Method and apparatus for modular inversion for information security and recording medium with a program for implementing the method

ABSTRACT

Values X and N of n bits and a parameter t are input, then Y=X2 −t  mod N is calculated, then an extended binary GCD algorithm is executed for Y to obtain S=y −1 2 k  mod N and k, and R=S2 −(k+t−2n)  is calculated for S, thereby obtaining a Montgomery inverse R=X −I 2 2n  mod N of X on a residue class ring Z/NZ.

BACKGROUND OF THE INVENTION

The present invention relates to a method and apparatus for modular inversion which is carried out for information security, for example, in digital cryptosystems and digital authentication systems which use encryption key generation, digital signature and blind signature schemes, and elliptic cryptosystem and so forth. The invention also pertains to a recording medium with the modular inversion method recorded thereon.

In the field of information security it is well-known that the calculation of modular inverse over a prime finite field GF(p) (where p is a prime) or residue class ring Z/NZ (Z is a group of integers and N is a positive integer) takes a wide variety of forms, some of which will be described below.

(a) Generation of sum (x₃, y₃) of two points (x₁, y₁) and (x₂, y₃) on an elliptic curve E/GF(p):

λ=(y ₂ −y ₁)/(x ₂ −x ₁)mod p  (a-1)

x ₃=λ² −x ₁ −x ₂ mod p  (a-2)

y ₃=λ(x ₁ −x ₃)−y ₁ mod p  (a-3)

(b) Part of signature generation of digital signature system ESIGN:

y=w/(kx ^(k−1))mod p  (b-1)

where x is an integer 1≦x≦pq−1, w is an integer in the range of 0≦w≦p−1, kεZ, and p and q are primes.

(c) Blind signature generation of digital signature system RSA:

s′=(r ^(e) m)^(d) mod N  (c-1)

s=s′/r mod N  (c-2)

 where r and m are integers 0≦r and m≦N−1, and e and d are integers 1≦e and d≦φ(N)−1, respectively.

The above examples use modular multiplications and modular inversions. The Montgomery method has been proposed to efficiently calculate modular residues. Listed below are definitions of some types of modular inversion that suit the Montgomery method.

Normal inversion i₁(X) = X⁻¹ mod N Kaliski inversion i₂(X) = X⁻¹B mod N Montgomery inversion i₃(X) = X⁻¹B² mod N

where B=2^(n), n is the number of bits of N, N<B<2N and XεZ/NZ The modular inversion mentioned herein includes any types of modular inversion as well as the above. Replacing the N with a prime p, the abovementioned inverse will be an inverse over GF(p). The following description will be given only of Z/NZ

Conventionally, for inputs X and N where X is equal to or greater than zero and smaller than N, a modular inverse of X over Z/NZ is calculated, for example, using an extended binary GCD method (extended binary Greatest Common Divisor method, an algorithm for producing X⁻¹2^(k) mod N and k, the former being expressed by bgcd(X, N)) The following example will be described in connection with the calculation of a Montgomery inverse.

Method 1:

Step 1: Calculate S and k by

S=bgcd(X, N)=X ⁻¹2^(k) mod N  (1)

where n≦k≦2n.

Step 2: Calculate a modular inverse R by

R=S2^(2n−k) mod N=N ⁻¹2^(2n) mod N  (2)

Step 1 is a process of executing the extended binary GCD algorithm for the inputs X and N. Since 2n−k>0, Step 2 is to calculate multiplication by power of 2.

The calculation (b) can also be used to obtain a Montgomery inverse by the method 2 shown below.

Incidentally, when d<0,

(a) Multiplication by power of 2: X2^(d)mod N

(b) Division by power of 2: X2^(−d)mod N

the calculation (b) can be done faster than (a).

Method 2:

Step 1: Y=X2^(−n) mod N  (3)

Step 2: S=bgcd(Y, N)(=X ⁻¹2^(n+k) mod N)  (4)

Step 3: R=S2^(−(k−n)) mod N(=X ⁻¹2^(2n) mod N)  (5)

Since k−n≧0, Step 3 performs a division by power of 2.

If the multiplication (a) and the division (b) consumes the same amount of time, then Method 1 involving the smaller number of steps enables the calculation to be made in a shorter time than in the case of using Method 2. In practice, however, since the division (b) can be conducted in a shorter time, it is presumed that the modular inversion by Method 2 may sometimes be processed in a shorter time.

Assuming that N is too large a value to calculate or process by an ordinary computer or processor at a time, the amounts of time for the calculations (a) and (b) increase as d becomes larger.

For example, in the case of using a method in which elementary operations are

(a)′ Multiplication by 2: X2 mod N

(b)′ Division by 2: X2⁻¹ mod N

and the calculation (a)′ is carried out d times as the calculation (a), the time for calculation (a) is d times longer than the time for calculation (a)′. Similarly, the time for calculation (b) is d times longer than that for calculation (b)′. The operations corresponding to calculations (a)′ and (b)′ will hereinafter be referred to as an elementary operation.

Method 2 conducts division by power of 2 instead of performing multiplication by power of 2 in Method 1, but needs to perform the elementary operation a larger number of times than does Method 1.

For example, when k=1.41n (It has been experimentally demonstrated that k and n bear this relation on average.) Method 1 performs the Bgcd algorithm, and besides, the elementary operation 0.59 times in Step 2. On the other hand, Method 2 performs the elementary operation n times in Step 1 and 0.41 n times in Step 3 in addition to the Bgcd algorithm, and hence it conducts the elementary calculation a total of 1.41n times. Accordingly, there is no possibility of Method 2 becoming faster than Method 1 unless the division by power of 2 is considerably faster than the multiplication by power of 2 (more than 2.3 times faster in the above example). Conversely, even if means for speeding up the multiplication by power 2, though not feasible at present, is available, no speedups are possible if only the division by power of 2 occurs.

SUMMARY OF THE INVENTION

It is an object of the present invention to provide a calculating method which permits reduction of the time for modular inversion necessary for information security, a modular inversion apparatus using the method, and a recording medium with a program recorded thereon for implementing the method.

Another object of the present invention is to provide a modular inversion method which enables multiplication and division by power of 2 to be performed efficiently and hence in a short time, a modular inversion apparatus using the method, and a recording medium with a program recorded thereon for implementing the method.

Still another object of the present invention is to provide a modular inversion method which enables an extended binary GCD to be calculated efficiently and hence in a short time, a modular inversion apparatus using the method, and a recording medium with a program recorded thereon for implementing the method.

The modular inversion method, the apparatus using the method and the program recorded on a recording medium for implementing the method according to a first aspect of the present invention:

(a) calculate Y, for n-bit input values X and N, by the following equation using a predetermined value t

Y=X2^(−t) mod N;

(b) calculate an extended binary GCD for said Y and N by the following equation to obtain S and k

S=bgcd(Y, N)=Y ⁻¹2^(k) mod N;

and

(c) perform the following equation using said S, k and t

R=S2^(−(k+t−m)) mod N, m=0, n, or 2n

and output said R as the modular inversion result.

According to a second aspect of the present invention, in the above modular inversion a division of input values S and N by power of 2 represented as S^(2−w) mod N, w being a predetermined number of bits to be calculated or processed at a time, comprises the steps of:

(a) calculating n′=−N⁻¹ mod 2^(w) for input values S and N;

(b) calculating s′=Sn′ mod 2^(w) from said n′ and S;

(c) calculating q=S+s′N from said s′, S and N; and

(d) calculating q2^(w) from said q and w as the result of said division by power of 2.

According to a third aspect of the present invention, in the above modular inversion, letting the number of bits that an apparatus for modular inversion processes at a time be represented by M, a multiplication of input values S and N by power of 2 represented as S2^(w) mod N, w being a predetermined number of bits to be calculated or processed at a time, comprises the steps of:

(a) calculating n′=2^(n+M−1)/N for said input values S and N;

(b) calculating t′=sn′/2^(2M−w−1) from said n′ and the value s of upper M bits of said S;

(c) calculating S′=S2^(w)−t′N from said S, N, t′ and w; and

(d) comparing said S′ and N, and if S′>N, repeating an update S′←S′−N to obtain S′ satisfying S′≦N, and if S′≦N. obtaining said value S′ as the result of said multiplication by power of 2.

According to a fourth aspect of the present invention, said extended binary GCD algorithm in said modular inversion comprising:

(b-1) a step of setting U₀=Y and V₀=N for said Y and N, initializing S₀=0, T₀=1 and k=0, and storing said U₀, V₀, S₀, T₀ and k in storage means;

(b-2) a GCD simulation step of calculating, from said values U₀ and V₀ stored in said storage means, u_(u), u_(v), v_(v) and v_(u) which satisfies, for predetermined w′,

gcd(U ₀ , V ₀)=gcd(|u _(u) U ₀ −u _(v) V ₀|/2^(w′) , |v _(v) V ₀ −v _(u) U ₀|/2^(w′)),

adding said w′ to said k in said storage means to obtain an updated value k, and storing said updated value k in said storage means together with said values u_(u), u_(v), v_(v) and v_(u);

(b-3) a multi-precision calculation step of calculating

V ₁=(v _(v) V ₀ −u _(u) U ₀)/2^(w′),

U ₁=(u _(u) U ₀ −u _(v) V ₀)/2^(w′),

S ₁ =u _(u) S ₀ +u _(u) Y ₀,

T ₁ =v _(u) S ₀ +v _(v) T0,

for said values U₀, V₀, T₀, u_(u), v_(v) and v_(u) stored in said storage means, temporarily storing V₁, N₁, S₁ and T₁ in said storage means, determining whether said value V₁ is negative or not, and if negative, inverting the signs of said temporarily stored values V₁ and T₁, determining whether said value U₁ is negative or not, if negative, inverting the signs of said temporarily stored values U₁ and S₁, and updating said values U₀, V₀, T₀ and S_(o) in said storage means with said temporarily stored values U₁, V₁, S₁ and T₁, said w′ being an integer equal to or greater than 4;

(b-4) a final processing step of calculating u_(u), u_(v), v_(u), v_(v) and c which satisfy

|u _(u) U ₀ −u _(v) V ₀|/2^(c) =gcd(U ₀ , V ₀)

|v _(v) V ₀ −v _(u) U ₀|/2^(c)=0

for said values U₀, V₀, t₀ and S₀ stored in said storage means, calculating S′=u_(u)S₀+u_(v)T₀, and adding said value c to said value k to update it; and

(b-5) an output step of outputting said value S′ and k as the results S and k of said extended binary GCD calculation.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart showing a Montgomery modular inversion over Z/NZ according to the present invention;

FIG. 2 is a functional block diagram illustrating an embodiment of an apparatus for Montgomery inversion over Z/NZ according to the present invention;

FIG. 3 is a functional block diagram illustrating an embodiment of an apparatus for calculating division by power of 2 over Z/NZ in modular inversion;

FIG. 4A is a functional block diagram depicting a specific operative example of an inversion part 25 in FIG. 3;

FIG. 4B is a flowchart showing an example of part of the procedure of control by a control part 20 in FIG. 3;

FIG. 5 is a flowchart showing an example of the procedure of division by power of 2 over Z/NZ;

FIG. 6 is a block diagram depicting the functional configuration of an apparatus for multiplication by power of 2 over Z/NZ;

FIG. 7 is a flowchart showing an example of the procedure of multiplication by power of 2 over Z/NZ;

FIG. 8 is an functional block diagram depicting an another example of the division apparatus;

FIG. 9 is an functional block diagram depicting an another example of the multiplication apparatus;

FIG. 10 is a flowchart showing the calculation procedure of a conventional binary GCD algorithm;

FIG. 11 is a functional block diagram illustrating a GCD calculating apparatus according to a third embodiment of the present invention;

FIG. 12 is a flowchart showing the flow of operation of the apparatus depicted in FIG. 11;

FIG. 13 is a functional block diagram depicting a GCD calculation initializing part 110 in FIG. 11;

FIG. 14 is a flowchart showing the flow of operation of the initializing part 110 depicted in FIG. 13;

FIG. 15 is functional block diagram depicting a GCD calculation simulating part 120 in FIG. 11;

FIG. 16 is a flowchart showing the flow of operation of the calculation simulating part 120 depicted in FIG. 15;

FIG. 17 is a functional block diagram depicting a multi-precision calculating part 130 in FIG. 11;

FIG. 18 is a functional block diagram depicting a final processing part 140 in FIG. 11;

FIG. 19 is a flowchart showing the flow of operation of the final processing part 140 depicted in FIG. 18;

FIG. 20 is a functional block diagram depicting an extended binary GCD calculating apparatus which is a modified form of the third embodiment;

FIG. 21 is a flowchart showing the flow of operation of the extended binary GCD calculating apparatus depicted in FIG. 20;

FIG. 22 is a functional block diagram depicting a multi-precision calculating part 230 in FIG. 20;

FIG. 23 is a flowchart showing the flow of operation of the multi-precision calculating part 230 in FIG. 22;

FIG. 24 is a flowchart showing part of the flow of operation of the final processing part 240 in FIG. 20;

FIG. 25 is a functional block diagram depicting a normal inverse calculating apparatus employing the extended binary GCD;

FIG. 26 is a functional block diagram depicting a Kaliski inverse calculating apparatus employing the extended binary GCD;

FIG. 27 is a functional block diagram depicting a Montgomery inverse calculating apparatus employing the extended binary GCD;

FIG. 28 is a functional block diagram depicting an inverse calculating apparatus applying the extended binary GCD to the first embodiment of the invention; and

FIG. 29 is a block diagram illustrating, by way of example, the actual of a program for performing the modular inversion according to the present invention which is stored on a recording medium.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

A description will be given first of the principle of the present invention.

Of the conventional methods for Montgomery inversion, the aforementioned Method 1 involves multiplication by power of 2 which is small in the number of repetitions of the elementary operation to be performed but is time-consuming, and Method 2 needs only to perform division by power of 2 but is required to execute the elementary operation a larger number of times.

Incidentally, it is known in the art that the repeating number k of the loop in the Bgcd algorithm is n≦k≦2n; experiments using concrete numerical values revealed that the size of each of the inputs X, N is any one of 256, 512 and 1024, the repeating number k of the loop falls within the following range in almost all cases:

1.41n−(0.05n+20)≦k≦1.41n+(0.05n+20)  (6)

Through utilization of this finding, the Montgomery inverse can be calculated by the following Method 3 which has advantages of both of Methods 1 and 2 in combination.

This invention method:

Step 1: Y=X2^(−t) mod N  (7)

Step 2: S=bgcd(Y, N)=Y ⁻¹2 mod N=X ⁻¹2^(t+k) mod N  (8)

Step 3: R=S2^(−(k+t−2n)) mod N=X ⁻¹2^(2n) mod N  (9)

To demonstrate the superiority of this invention method over the conventional Methods 1 and 2, assume that the value t is approximately equal to 64n+20, but in practice, the value t is not limited specifically thereto.

Step 3 of Method 2 always performs division, but Step 3 of this invention method may perform division or multiplication according to the predetermined value t and the value k calculated in Step 2.

It was ascertained experimentally that, as the result of Eq. (6), the value k in this invention method is in the range of

 1.36n−20≦k≦1.46n+20  (10)

with a very high probability and that Eq. (6) holds true. Accordingly, in the cases of n=256, 512 and 1024, the maximum value k, 1.46n+20, and the value t, 0.64n+20, provide

0<k′ where k′=k+t−2n≦0.1n+40  (11)

This means that Step 3 of this invention method needs only to perform division by power of 2. In this instance, this invention method is higher in computational efficiency than Method 2.

Method 2 performs division by 2^(n) in Step 1 and division by 2^(k−n) in Step 3. This invention method performs division by 2^(t) in Step 1 and division by 2^(−k′)=2^(k+t−2n) in step S3.

That is, Steps 1 and 3 of Method 2 carry out calculation equivalent to a right shift operation corresponding to a total of k bits (on average 1.41n bits as mentioned previously). On the other hand, this invention method needs only to perform calculation equivalent to a right shift operation corresponding to k+2t+2n bits (on average 0.69n+40 bits with k=1.41n and t=0.64n+20). For example, setting n=256, this invention method is about 45% faster than Method 2 (except the Bgcd algorithm). In the above example, since t=0.64n+20, k′≧0 and only division is performed in Step 3, but if t<0.64n+20, k′ may take a negative value as well, in which case multiplication by power of 2 is performed. In this case, too, the value t can be chosen such that the number of repetitions of the elementary operation to be performed (the absolute value of k+2t−2n) is small; hence, multiplication by power of 2 can also be carried out in a shorter time than in the cases of by Methods 1 and 2.

That is, the modular inversion method according to the present invention is based on the finding that the number of repetitions of the elementary operation by power of 2 can be reduced by additionally introducing a new parameter t as the power of 2 and selecting an optimum value for t.

First Embodiment

Flowchart for Montgomery Inversion Over Z/NZ

FIG. 1 is a flowchart for Montgomery inversion over Z/NZ according to the present invention.

This procedure is to calculate an output value X⁻¹2^(2n) mod N (where n is the size or bit length of N) from input values X, N (odd).

An appropriate value for t is determined according to the size of the input N and the processing rate ratio between multiplication by power of 2 and inversion by power of 2. It is preferable that t be approximately in the range of 0.64n+20 to 0.54n−20. From the viewpoint of faster calculation, it is particularly preferable that the value t be an integral multiple of, for example, 16 which is the number of bits to be processed on hardware of the processing unit at a time.

Step S1: First, calculate Y by the following equation.

Y=X2^(−t) mod N

Step S2: Next, perform an extended binary GCD algorithm for Y and N, and obtain S and k″ as output values by the following equation.

S=gcd(Y, N)=Y ⁻¹2^(k) mod N  (12)

Step S3: Finally, perform the following operation using these values S and k

R=S2^(−(k+t−2n)) mod N=S2^(−k′) mod N  (13)

where k′=k+t−2n. The calculation result R is output as the result of Montgomery inversion. In this calculation, if k′>0, then division by power of 2 is performed to obtain the value R, and if k′<0, then multiplication by power of 2 is performed.

Apparatus for Montgomery Inversion Over Z/NZ

FIG. 2 illustrates an embodiment of an apparatus 100 for Montgomery inversion over Z/NZ. This apparatus 100 is to output X⁻¹2^(2n) mod N for inputs X and N. The inputs X and N are provided via an input part 11 and stored in storage parts 12 and 13, respectively, and at the same time, they are fed to a division part 14 by power of 2 over Z/NZ. The division part 14 performs the following calculation for the inputs X and N:

Y=X2^(−t) mod N  (14)

The calculation result is provided to an extended GCD calculating part 15 and stored in its storage part 15A. The value t is prestored in a storage part 15.

The extended GCD calculating part 15 uses the input values Y and N to perform an extended binary GCD calculation by the following equation to obtain S and k.

S=Y ⁻¹2^(k) mod N  (15)

The values S and k are provided to a comparison part 17 and stored in its storage parts 17A and 17B, respectively.

The comparison part 17 uses the size (bit length) n of the input value N and the values k and t to determine whether −k′=2n−k−t is positive or negative. If negative, |k′|=K=−2n+k+t and S are provided to a calculating part 18A for division by power 2 over the Z/NZ, and if positive, K=2n−k−t and S are provided to a calculating part 18B for multiplication by power of 2 over Z/NZ.

The division part 18A uses the input values S, K and N to calculate

R=S2^(−K) mod N  (16)

and provides the calculation result R to an output part 19. The multiplication part 18B uses the input values S, K and N to calculate

R=S2^(K) mod N  (17)

and provides the calculation result R to the output part 19. The output part 19 outputs the value R as the result of the modular inversion.

A control part 10 has control over the apparatus 100 from the input part 11 to the output part 19.

While in the above the present invention has been described as being applied to the Montgomery inversion, the invention is also applicable to other modular inverse calculating apparatuses. That is, letting Step 3 in this invention method be represented by

R=S2^((k+t−m)) mod N  (18)

Montgomery inversion is m=2n but the above-mentioned application can be achieved by setting normal inversion (X⁻¹ mod N) as m=0 and Kaliski inversion (X⁻¹2^(n) mod N) as m=n. The parameter t is so chosen as to minimize the calculating time, but an appropriate value is chosen for each inversion and it varies with the value n or the like.

One or all of the storage parts 12, 13, 15A, 16, 17A and 17B may also formed as individual storage areas of one storage device. Although in the above the present invention has been described as being applied to the inversion over Z/NZ, the invention is equally applicable to the inversion over GF(p) (where p is a prime) which is used for elliptic curve cryptosystem. It will be apparent that the apparatus for modular inversion according to the present invention can also be implemented by executing a program by an electronic computer.

The above-described embodiment of the modular inversion according to the present invention is used for modular inversion in the field of information security as referred to previously. Its application will be concretely described below.

An equation for calculating from two points (x₁, y₁) and (x₂, y₂) on the aforementioned elliptic curve E/GF(p) a point (x₃, y₃) of the sum of the two points is expressed by Eqs. (a-1), (a-2) and (a-3) mentioned previously. That is, the calculation of the point (x₃, y₃) involves the calculation of λ by Eq. (a-1). Setting y=y₂−y₁ and X=x₂−x₁, Eq. (a-1) is expressed as follows:

λ=(y ₂ −y ₁)(x ₂ −x ₁)⁻¹ mod p=yX ⁻¹ mod p

In the first place, modular inverse is calculated by X′=X⁻¹ mod p and then λ=yX′ mod p is calculated using result of modular inverse. The modular inverse is calculated as described below by applying the method according to the above-described first embodiment to the calculation of the modular inverse X′=X⁻¹ mod p. To begin with, the predetermined value t is used to calculate

Y=X2^(−t) mod p

Then, the values Y and p are used to calculate S and k by the following equation

S=bgcd(Y, p)=T ⁻¹2^(k) mod p

Further, the values S and t are used to calculate the modular inverse X′ by the following equation

X′=S2^(−(k+t−m)) mod p where m=0, n or 2n

The modular inverse X′ thus calculated is used to obtain λ by the following equation

λ=yX′ mod p

In the signature generation by the digital signature scheme ESIGN, X=kx^(k−1) is calculated expressing Eq. (b-1) as follows:

y=w/(kx ^(k−1))mod p=wX ⁻¹ mod p

Next, y is calculated as described below by applying the method of the first embodiment to this modular inversion with X′=X⁻¹ mod p. That is, the predetermined value t is used to calculate

Y=X2^(−t) mod p

Next, the values Y and p are used to calculate S and k by the following equation

S=bgcd(Y, p)=Y ⁻¹2^(k) mod p

Further, the values S and t are used to calculate the modular inverse X′ by the following equation

X′=S2^(−(k+t−m)) mod p where m=0, n or 2n

The value y of Eq. (b-1) can be obtained by the following equation using the thus calculated modular inverse X′.

y=wX ⁻¹ mod p=wX′ mod p

In the blind signature of the digital signature scheme RSA, the method of the first embodiment is applied to the modular inversion in Eq. (c-2). That is, the value R is set as R=r⁻¹ mod N and the predetermined value t is used to calculate

Y=r2^(−t) mod N

Next, the values Y and N are used to calculate S and k by the following equation

S=bgcd(Y, N)=Y ⁻¹2^(k) mod N

Further, the values S and t are used to calculate modular inverse R by the following equation

R=S2^(−(k+t−m)) mod p where m=0, n or 2n

The value s in Eq. (c-2) can be obtained by the following equation using the thus calculated modular inverse R.

s=s′/r mod N=s′R mod N

Second Embodiment

Steps 1 and 3 of the modular inversion according to the first embodiment of the present invention have been described to calculate division or multiplication by power of 2. A mere division by 2^(k) can be calculated by a k-bit-shift operation. For example, in the case of dividing by 2³ a number 40 (in decimal representation), which is 101000 in binary representation, a three-bit right shift operation is performed. This provides 101 in binary representation, allowing ease in finding 5. However, a mere k-bit-shift operation is not enough to calculate division by 2^(k) on the Z/NZ like the calculation in the division part 14 or 18 in FIG. 2. A conventional solution to this problem is to execute the following process, for example, in the case of calculating an output S2^(−k) mod N from inputs S, k and N (odd).

(a) If the input value S is divisible by 2, then a calculation S/2 is performed and the calculation result is newly set as S.

(b) If the input value S is not divisible by 2, then a calculation (S+N)/2 is performed and the calculation result is newly set as S. The above step (a) or (b) is repeated k times.

The division by 2 in step (a) or (b) can be done by the bit-shift operation.

On the other hand, the multiplication by 2^(k) can be achieved by a k-bit-shift operation. For example, in the case of multiplying by 2³ a number 40 (in decimal representation), which is 101000 in binary representation, a three-bit left shift operation is carried out. This provides 101000000 in binary representation, allowing ease in calculating 320. However, as is the case with the above-mentioned division, a mere k-bit shift operation is not enough to calculate multiplication by 2^(k) on the Z/NZ like the calculation in the multiplication part 18B in FIG. 2. For example, in the case of calculating an output S2^(k) mod N from inputs S, k and N (odd), it is conventional to execute the following process.

(a) The input value S is doubled (S×2), and the multiplication result is newly set as S; and

(b) If the new S is larger than N, then S−N is calculated, and the calculation result is newly set as S, followed by return to step (a). If S is not larger than N, then the procedure returns directly to step (a).

The steps (a) and (b) are carried out k times. The multiplication by 2 represented by S×2 is implemented using a bit shift device.

The above-mentioned division by 2^(k) on the Z/NZ repeats the division by 2 (one-bit right shift) just k times and an addition +N a maximum of k times (on average k/2 times). The conventional multiplication by 2^(k) on the Z/NZ repeats the multiplication by 2 (one-bit left shift) just k times and a subtraction −N a maximum of k times (on average k/2 times). The computing time for such multiplication and division by 2 and addition and subtraction as mentioned above is in proportion to the number of bits of the value handled (the input value), and the processing time increases in proportion to k times the number of bits. It is desirable, therefore, to reduce the processing time by handling a plurality w of bits (where w is an integer equal to or greater than 2) at a time.

By the way, a present-day computer has its hardware formed by memories capable of reading therefrom and writing thereto in units of M bits (where M is 8, 16, 32, . . . ) (Condition 1). In view of this, it is efficient to perform calculations in units of M bits by setting the number w of bits, which are simultaneously processed in the multiplication and division by 2^(k), at a desired value in the range of 2≦w≦M, preferably w=M.

For example, in a conventional processing unit for calculating division or multiplication by 2^(k), when the input value is large, a one-bit shift operation of a large integer is repeated. Under Condition 1, however, the computing time by the one-bit-shift operation is equal to or longer than the computing time needed by the M-bit-shift operation.

As a solution to this problem, the second embodiment of the present invention do away with the one-bit-shift operation, but instead performs the shift operation in units of a plurality w of bits, for example, M bits which the processing unit can handle at a time. By this, the number of repetitions of the shift operation is reduced down to 1/M the number of times the one-bit-shift operation takes place. In the division by power of 2, the shift operation is carried out, for example, in steps of w=M bits and possible additions, which are likely to be done while the w-bit-shift operation is repeated w times, are carried out at a time. Whether the addition S+N is performed in bit-by-bit processing is dependent upon whether the least significant bit of S is 0 or 1, but the value of the least significant bit is determined as the result of the preceding multiple additions. On this account, a new calculation is needed to process the least significant bits of S and N at a time so as to perform simultaneous execution of processes of w iterations.

By precalculating n′=−N⁻¹ mod 2^(w) and setting s′=Sn′ mod 2^(w), −s′N=S mod 2^(w); hence, −s′N and N match in the range of at least w lower bits. Then, by dividing S+s′N by 2^(w), that is, by newly setting upper bits of S+s′N except the w lower bits (00 . . . 0) as S, S2^(−w) mod N can be obtained equivalently.

This principle is such as described below. Based on the property known as the Chinese remainder theorem, the following equation holds true:

S={SN ⁻¹ mod r)N+(Sr ⁻¹ mod N)r} mod Nr  (18)

where r and N are relatively prime. Eq. (18) can be modified as follows:

Sr ⁻¹ mod N={S−SN ⁻¹ mod r)N mod Nr}/r  (19)

Hence, setting r=2^(w) and n′=−N⁻¹ mod2^(w),

S2^(−w) mod N={S+(S mod r)(N ⁻¹ mod r)N mod Nr}/r={(S+s′N mod 2^(w) N)/2^(w)} mod N  (20)

where s′=Sn′ mod 2^(w).

By repeatedly performing this operation, the k iterations of the loop involved in the conventional division method could also be reduced down to k/w iterations.

While in the above the means for division has been described, multiplication can also be performed in a similar manner. Letting M represent the number of bits to be processed at a time by the computer for implementing this invention method, the number w of bits that are processed at a time for multiplication is equal to or smaller than M (2≦w≦M).

In the multiplication by power of 2, it is necessary to simultaneously perform possible subtractions −N that are likely to take place during w iterations of the loop. Assume that the number n of bits of N is equal to that of S. w is a preset number of bits to be processed at a time in the division. Whether the subtraction is carried out or not is determined depending upon whether the most significant bit of S is 0 or 1. The value of this bit reflects the results of preceding subtractions. For this reason, the prediction of possible addition involves a calculation which uses the most significant bits of both S and N.

In the first place, n″=[2^(n+M−1)/N] is precalculated (where n is the number of bits of N and [a] is assumed to be a maximum integer not exceeding a given real number a, that is, a value with the fractional portion of the number a dropped).

Step 1: Calculate S′=S2^(w).

Step 2: Calculate s′=[S/(2^(n+w−M))] (That is, the value of upper w bits of S′ is made s′).

Step 3: Calculate t=s′n″ (value of 2M bits).

Step 4: Calculate t′=[t/2^(M−w−1)].

Since t′ and S′/N match in the range of at least 2M−w−2 upper bits, S2^(w) mod N can be obtained equivalently (under the condition M≧w+2) by calculating S′−t′N.

This principle is based on the following fact.

Since n″ and s′ are calculated which satisfy

(2^(n+M−1) /N)−1<n″<2^(n+M−1) /N  (21)

S/2^(n−M+w)−1<s′<S/2^(n−M+w)  (22)

the following equation holds true:

2^(2M−w−1) S/N>t=s′n″>(2^(2M−w−1) S/N)−s′−n″+1  (23)

that is,

S/N>t′>S/N−(s′+n″−1)/2^(2M−w−1) >S/N−2M+1/2^(2M−w−1) >S/N−2^(w−M+2)  (24)

By this, the k iterations of the loop in the conventional multiplication method can be reduced down to k/w iterations.

Apparatus for Division by Power of 2 Over Z/NZ

FIG. 3 illustrates an apparatus 200 for division by power 2 over the Z/NZ which is used for the modular inversion in the first embodiment. The apparatus 200 calculates and outputs S2^(−k) mod N for inputs S, N and k. Assume that the number w of bits, which are processed by this apparatus 200 at a time, is equal to the number M of bits which are processed at a time by the computer that implements the apparatus 200. In this case, however, k is smaller than 2^(w) are called multi-precision and those smaller than 2^(w) single-precision. Values greater than 2

The values S, k and N are input via an input part 21 and stored in storage parts 22, 23 and 24, respectively. The value N stored in the storage part 24 is input into a modulo 2^(w) inversion part 25, which calculates n′=−N⁻¹ mod 2^(w) for the input N and stores it in its memory 25A. In the case where the same value N is input into the inversion part 25 twice or more, however, it is possible to employ such a configuration as shown in FIG. 4A, in which n′=−N⁻¹ mod 2^(w) is stored in the memory 25A for the input N and read out therefrom by the input N for storage in a storage part 26. When a decision part 25B determines from the value read out of the memory 25A that n′ is not present, n′=−N⁻¹ mod 2^(w) is calculated in a calculating part 25C and stored in the storage part 26 and in the memory 25A. When the value N is large, it is preferable that the calculating part 25C calculate first y=N mod 2^(w) in a calculating part 25Ca and then n′=−y⁻¹ mode 2^(w) in a calculating part 25Cb.

The storage parts 22, 23, 24 and 26 are connected to a control part 20. The control part 20 controls respective parts of the apparatus 200 and executes their processes. As depicted in FIG. 4B, it is checked in step S1 whether the value k stored in the storage part 23 is 0 or not, and if not, then it is checked in step S2 whether the value k is smaller than w=M (where M is a preset number of bits to be processed by the computer for each operation, for example, 8, 16, 32, . . . ); if k is not smaller than w, then w is stored as w′ in a storage part 20A in step S3, after which k in the storage part 23 is updated with k−w′.

Thereafter, the value S is updated in step S4 as described below. That is, the control part 20 supplies the value S stored in the storage part 22 to a power-of-2 modular reduction part 31 and an addition part 35, the value n′ in the storage part 26 to a multiplication part 32, the value N in the storage part 24 to a multiplication part 34, and the value w′ in the storage part 20A to the power-of-2 modular reduction parts 31 and 33 and a power-of-2 division part 36.

And the control part 20 controls the respective parts to execute their processes. To begin with, the modular reduction part 31 calculates s=S mod 2^(w′) from the inputs S and w′ thereinto, and stores the calculation result in a storage part 31A. The multiplication part 32 calculates sn′=(S mod 2^(w′))n′ from the input n′ and the value s=S mod 2^(w′) stored in the storage part 31A, and stores the calculation result in a storage part 32A. The modular reduction part 33 calculates

s′=(S mod 2^(w′))n′ mod 2^(w′)  (25)

from the input w′ and the value sn′=(s mod 2^(w) ^(w′))n′ stored in the storage part 32A, and stores the calculation result in a storage part 33A. The multiplication part 34 calculates s′N from the inputs s′ from the storage part 33A and N from the storage part 24, and stores the calculation result in a storage part 34A. The addition part 35 calculates an addition, q=S+s′N, of the values S and s′N stored in the storage parts 2 and 34A, respectively, and stores the calculation result in a storage part 35A. The division part 36 calculates (S+s′N)/2^(w) from the value q=S+s′N from the storage part 35A and the input w′, and stores the calculation result as a new value of S in a storage part 36A. That is, the division part 36 divides S+s′N by 2^(w′) through utilization of the fact that the least significant bit w′ of (S+s′N) becomes 0.

Finally, upon completion of the operation by the division part 36, the control part 20 updates the content of the storage part 22 with the value S newly stored in the storage part 36A.

Steps S1 through S4 are repeatedly executed as long as k≧w. If k is not zero in step S1 and if k is smaller than w, k is stored as w′ in the storage 20A in step S5, and then k in the storage part 23 is made 0, followed by updating S in step S6 as in step S4. Since k=0 after execution of steps S5 and S6, k in the storage part 23 is decided to be zero in step S1, and in step S7 the content S of the storage part 22 is output as the calculation result S^(−k) mod N, with which the updating process ends.

Incidentally, the modular reduction parts 31 and 33 and the multiplication part 32 constitute a power-of-2 modular reduction means 30A, and the addition part 35 and the multiplication part 34 constitute multiplication/addition means 30B.

Division Power of 2 on Z/NZ

FIG. 5 shows the procedure of division by power of 2 on the Z/NZ. The calculation itself needed for the modular division is the same as the calculation which is performed by the apparatus depicted in FIG. 3. Now, assume that the number w of bits, which are processed at a time in the division method of the present invention, is equal to the number M of bits that the calculating apparatus processes at a time.

Step S1: Calculate K=[k/w];

Step S2: Calculate y=N mod 2^(w); and

Step S3: Calculate n′=−y mod 2^(w) to obtain n′=−N−1 mod 2^(w).

Step S4: Then, execute the following steps S4 through S8 K=[k/w] times. That is, a check is made to see if K=0, and if not:

Step S5: Calculate s=S mod 2^(w);

Step S6: Calculate s′=sn′ mod 2^(w);

Step S7: Update S with (S+s′N); and

Step S8: Decrement K by one and return to step S4.

The processes of steps S4 to S8 correspond to steps S9 to S4 in FIG. 4B.

If K=0 in step S4, the following steps S9 to S12 are executed.

Step S9: Calculate w′=k mod w;

Step S10: Calculate s=s mod 2^(w′);

Step S11: Calculate s′=sn′ mod 2^(w′); and

Step S12: Update S with (S+s′N)/2^(w′) and output the updated S.

The processes of steps S9 through S12 correspond to the processes of steps S5, S6, S1 and S7 in FIG. 4B.

Though not referred to above in respect of FIG. 5, each calculation result is used after being temporarily stored in storage means as depicted in FIG. 3. As will be understood from the description taken in conjunction with FIG. 5, the process for k depicted in FIG. 4B indicates that the process with w=w′ is executed K=[k/w] (where k≧w) times and that the process with k mod w=w′ (where k<w) is executed once; this is exactly the same process as that depicted in FIG. 5. It is also possible, however, to adopt a method which calculates K=[k/w] as in FIG. 5 and decrements K by 1 upon each calculation. The same holds true with regard to the procedure of operation by the apparatus described later on with respect to FIG. 6.

As will be seen from the above, the basic operation of the modular division apparatus according to the second embodiment of the present invention is the calculation of S2^(−w) mod N. This calculation can be done in FIG. 3 by calculating n′ in the modular inversion part 25, s′ in the modular reduction means 30A, and S=q/2^(w) in the modular division part 36 and outputting therefrom the calculation result. That is, in FIG. 5 the processes of steps S2, S3, S5, S6 and S7 are executed and the calculation result in step S7 is output.

Apparatus for Multiplication by Power of Z/NZ

FIG. 6 illustrates an example of an apparatus 400 for multiplication by power of 2 over the Z/NZ according to the second embodiment of the present invention. The apparatus 400 outputs S2^(k)mod N for inputs S, N and k. Letting M represent the number of bits for unit operation of a computer that implements this apparatus, the number w of bits to be processed at a time in this example is preset such that w≦M. The values S, k and N are input via an input part 41 and stored in storage parts 42, 43 and 44, respectively. For the value N in the storage part 44, n″=[2^(n+M−1)/N] is calculated in a division part 45 and the calculation result is stored in a storage part 46. The n in the above is the number of bits of each of the values N and S, and it is provided from a control part 40 to the division part 45. When the same N is input into the apparatus 400 twice or more, the above-mentioned calculation result n″=[2^(n+M−1)/N] may be prestored in a memory of the division part 45. This can be done by performing the same process as described above in connection with FIG. 4A.

The control part 40 controls performs the control process for each part and, for the storage part 43, carries out the same processes as depicted in FIG. 4B. Thereafter, the control part 40 inputs the value S from the storage part 42 and a value w′, determined in the same manner as is the case with w′ in FIG. 4B, into a power-of-2 multiplication part 55, then calculates therein S2^(w′), and stores it in a storage part 55A. Further, the control part 40 inputs the number n of bits and the value S from the storage part 42 into a power-of-2 division part 51, then calculates therein s=[S/2^(n−M)], and stores it in a storage part 51A.

The control part 40 inputs the values n″ and s from the storage parts 46 and 51A into a multiplication part 52, then calculates t=n″s, and stores the value t in a storage part 52A.

Next, a power-of-2 division part 53 uses the value t from the storage part 52A and the value w′ to calculate t′=[t/2^(2m−w′−1)] and stores it in a storage part 53A. A multiplication part 54 calculates t′N for the values t′ and N provided thereto from the storage parts 53A and 44, respectively, and stores it in a storage part 54A. A subtraction part 56 calculates S′=S2^(w′)−t′N for the values t′N and S2w′ input thereinto from the storage parts 54A and 55A, respectively, and stores the calculation result S′ in a storage part 56A. The calculation of the value S′ utilizes the fact that upper M−2 bits of the value −t′N become zeroes. A comparison part 57 compares the value S′ and N stored in the storage parts 56A and 44, respectively, and if S′<N, then provides the value S′ to the control part 40, which updates the value s in the storage part 42 with the input S′. If S′≧N, the value S′ is provided to a division part 58. The division part 58 subtracts from the input S′ thereinto the value N in the storage part 44, and returns the subtraction results S′−N as S′ to the comparison part 57, which makes a check again to see if S′<N. If so, the comparison part 57 provides the value S′ to the control part 40, which updates the value S in the storage part 42 with the input S′.

As is the case with FIG. 4B, the control part 40 updates the value S in the storage part 42 with the input S′ provided from the comparison part 57 when S′<N and with the input S′−N from the division part 58 when S′≧N, thereafter returning to Step S1. Then, if k=0, the control part 40 outputs the value S in the storage part 42 as the final result of calculation of S^(2k) mod N.

Multiplication by Power of 2 Over Z/NZ

FIG. 7 is a flowchart showing the procedure for multiplication by power of 2 over Z/NZ according to the second embodiment of the present invention. This example also calculates S^(2k) mod N as is the case with the apparatus depicted in FIG. 6.

Step S1: Calculate K=[k/w]; and

Step S2: Calculate n″=[2^(n+M−1)/N].

Step S3: Repeat the following steps S4 through S8 K=[k/w] times.

First, a check is made to see if K=0, and if not, perform the following steps S4 through S9.

Step S4: Calculate s=[S/2^(n−M)];

Step S5: Calculate t′=[sn″/2^(2M−w−1)];

Step S6: Update S with S2^(w)−t′N;

Step S7: Decrement K by 1;

Step S8: Make a check to see if S<N;

Step S9: If not, perform updating S←S−N and return to step S8. If S<N in step S8, return to step S3, and if K=0 in step S3, then perform the following steps S10 through S15.

Step S10: Calculate w′=k mod w;

Step S11: Update n″ with [n″/2^(w−w′)];

Step S12: Calculate s=[S/2^(n−M)];

Step S13: Calculate t′=[sn″/2^(2M−w′−1)];

Step S14: Update S with S2^(w)−t′N;

Step S15: Make a check to see if S<N;

Step S16: If not, then update S with S−N and returns to step S15, and if S<N, then outputs S in step S14.

Though not shown in FIG. 7, either, each calculation result is used after being temporarily stored in storage means as depicted in FIG. 6. In the multiplication by power of 2, the basic operation of the present invention is the calculation of s2^(w) mod N as referred to previously. In FIG. 6, this calculation can be done by calculating n″ in the division part 45, t′ in the first calculating means 50A composed of the division part 51, the multiplication part 52 and the division part 53, and S′ in the second calculating means 50B composed of the multiplication parts 54 and 55 and the subtraction part 56, executing the processes in the comparison part 57 and the subtraction part 58 until S′<N is obtained, and outputting the value S′ as the result of calculation S2^(w) mod N.

In FIG. 5, steps S9 through S12 may be performed prior to steps 4 through 8. Similarly, in FIG. 7 steps S3 through S9 may be carried out after steps S10 through S16. All or some of the storage parts 22, 23, 24, 26, 20A and 31A to 36A in FIG. 3 may be formed by individual storage areas of one storage device. Likewise, all or some of the storage parts 42, 43, 44, 46, 51A to 56A and 58A in FIG. 6 may be formed by individual storage areas of one storage device.

FIG. 8 illustrates an embodiment which calculates division S2^(−k) mod N by power of 2 through the use of a plurality of calculating devices which differ in the number M of bits that are processed at a time. This embodiment employs p calculating devices which perform operations in units of different numbers w₁, w₂, . . . , w_(p) of bits. The inputs S, k and N provided via the input part 21 are stored in the storage parts 22, 23 and 24, respectively. The input k is split by splitting part 37 into p pieces of values which satisfy k=w₁+w₂+, . . . , +w_(p) (where w_(i)>0, i=1, 2, . . . , p), and they are stored in storage parts 37A₁, 37A₂, . . . , 37A_(p). Reference numerals 38 ₁, 38 ₂, . . . , 38 _(p) denote power-of-2 dividing devices, each of which is composed of the modular inversion part 25, the modular reduction means 30A, the multiplication/addition means 30B and the division part 36 depicted in FIG. 3. These dividing devices are given w₁, w₂, . . . , w_(p), respectively. The dividing device 38 ₁ inputs thereinto S, w₁ and N, and calculates, through the above-described process with w set as w₁,

S ₁ =S2^(−w) ^(₁) mod N  (26)

and stores the calculation result in a storage part 38A₁. The dividing device 382 inputs thereinto S₁, w₁ and N, and calculates

S ₂ =S2^(−w) ^(₂) mod N=S2^(−w) ^(₁) ^(−w) ^(₂) mod N  (27)

and stores the calculation result in a storage part 38A₂. This is followed by similar processing. Finally, the dividing device 38 p calculates

S _(p) =S _(p−1)2^(−w) ^(_(p)) mod N=S2^(−k) mod N  (28)

and outputs it as the division result.

Incidentally, all of the p values w₁, w₂, . . . , w_(p) need not necessarily to differ but some of them may be equal. That is, for example, in the case of using two calculating devices which perform operation in units of w₁ and w₂ bits, respectively, the input k is split into k=aw₁+bw₂+c; the dividing device 38 ₁, formed by the calculating device of type carrying out operation in units of w₁ bits, performs division a times as described previously with reference to FIG. 3, and the division device 38 ₂, formed by the calculating device of the type carrying out operation in units of w₂ bits, performs division b times. As for a fraction c smaller than w₁ or w₂, the division by the dividing device 38 ₁ or 38 ₂ needs only to be made with w₁ or w₂ as w₁′ or w₂′. That is, at least two of the p values w₁ to w_(p) differ from the others, and divisions common in the number w_(i) of bits to be processed at a time are carried out by one of the dividing devices 38 ₁ to 38 _(p).

The same holds true with regard to the multiplication by power of 2. An example is shown in FIG. 9. The inputs S, k and N provided via an input part 41 are stored in storage parts 42, 43 and 44, respectively. The input k is split by splitting part 47 into p values which satisfy k=w₁+w₂+, . . . , +w_(p) (where w_(i)>0, i=1, 2, . . . , p), and they are stored in storage parts 47A₁, 47A₂, . . . , 47A_(p). The values w₁ . . . , w_(p) are predetermined. Reference numerals 48 ₁, 48 ₂, . . . , 48 _(p) denote power-of-2 multiplying devices which perform operations in units of M₁, M₂, . . . , M_(p) bits, respectively, and each of which is composed of the division part 45, the first calculating means 50A, the second calculating means 50B, the comparison part 57 and the subtraction part 58 in FIG. 6. These multiplying devices are given w₁, w₂, . . . , w_(p), respectively. The multiplying device 48 ₁ inputs thereinto S, w₁ and N, and calculates S₁=S2^(w1) mod N through the above-described process with w₁ set as w′, and stores the calculation result in a storage part 48A₁. The multiplying device 48 ₂ inputs thereinto S₁, w₁ and N, and calculates, through the above-described process with S₁ set as S and w₂ as w′,

S ₂ =S ₁2^(w) ^(₂) mod N=S2^(w) ^(₁) ^(+w) ^(₂) mod N  (29)

and stores the calculation result in a storage part 48A₂. This is followed by similar processing. Finally, the multiplying device 48 _(p) calculates, with the input S_(p−1) as S and w_(p) as w′,

S _(p) =S _(p−1)2^(w) ^(_(p)) mod N=S2^(k) mod N

and outputs it as the multiplication result.

In this example, w₁≦M₁, w₃≦M₂, . . . , w_(p)≦M_(p), but as is the case with the division, the input k may be split into values which satisfy, for example, k=aw₁+bw₂+c, and the multiplication is carried out accordingly. In this case, too, the number of multiplying devices 48 ₁, 48 ₂, . . . used is equal to or smaller than p.

The division and multiplication by power of 2, above described in respect of the second embodiment of the invention, are applicable to step 1 and step 3 of the modular inversion in the first embodiment, that is, the division by 2^(−t) (when t is positive) or multiplication (when t is negative) in Eq. (7), and the division by 2^(−(k′−2n)) (=2^(2n−k−t)) (when k′−2n is positive) or multiplication (when k′−2n is negative) in Eq. (9). More specifically, the division method of the second embodiment can be applied to the division part 14 in FIG. 2 by using the input X, N and t in the first embodiment as the inputs S, N and k in the division method of the second embodiment. The value S obtainable with the division is provided as the output Y from the division part 14 in FIG. 2. The division method of the second embodiment can be applied to the division part 18A in FIG. 2 by using the inputs S, N and k in the first embodiment as the input S, N and k in the division method of the second embodiment. The value S obtainable with the division is provided as the output R from the division part 18A in FIG. 2. The multiplication method of the second embodiment can be applied to the multiplication part 18B in FIG. 2 by using the inputs S, N and k in the first embodiment as the inputs S, N and k in the multiplication method of the second embodiment. The value S resulting from this multiplication is provided as the output R from the multiplication part 18B in FIG. 2.

In these divisions, n′=−N⁻¹ mod 2^(w) is a value that is determined only by N and w. In the information security scheme used, N is usually fixed and the number w of bits for simultaneous processing is also fixed. Hence, provision may be made to precalculate n′ and store it as a constant, for example, in a ROM from which it is read out as required. For example, in the case of applying the division method of the second embodiment to both of the division parts 14 and 18A in FIG. 2, n′ is calculated by the calculation in the modular inversion part 25 in FIG. 3 in either case; hence, n′ can be used in common to the division parts 15 and 18A in FIG. 2 by precalculating and prestoring it in the storage part 25A in FIG. 3. Further, even if the input X is changed in such a modular inversion as X⁻¹B^(m) mod N (where B=2^(n) and m=0, 1, or 2) by the modular inversion apparatus of FIG. 2, the value n′ need not be changed. On the other hand, when N takes several predetermined values, n′ is calculated for each value of N and stored in the storage part 25A in correspondence with each value of N as described previously with reference to FIG. 4A. By this, the value of n′ corresponding to a particular value of the input N can be read out of the storage part 25A for use.

Third Embodiment

The process of Step 2 in the Montgomery inversion in the first embodiment of the invention is an extended binary GCD calculation process as mentioned previously. The third embodiment is directed to a method and apparatus for efficient extended binary GCD calculation in the modular inversion by the present invention.

Conventional methods for obtaining the greatest common divider (GCD) are (1) Euclidean algorithm, (2) binary GCD algorithm and (3) algorithm L. The algorithm L is a method intended to improve the efficiency of the Euclidean algorithm for large numbers.

(1) Euclidean Algorithm

The Euclidean algorithm utilizes the fact that when setting

X _(i) =Q _(i) Y _(i) +R _(i)  (30)

the following equation holds true:

gcd(X _(i) , Y _(i))=gcd(Y _(i) , R _(i))  (31)

X_(i) and Y_(i) are obtained from X₀ and Y₀ by repeated application of Eq. (30) with

X _(i+1) =Y _(i) , Y _(i+1) =R _(i)  (32)

Since

gcd(X ₀ , Y ₀)=gcd(X ₁ , Y ₁)= . . . gcd(X _(j), 0)=X_(j)  (33)

gcd(X₀, Y₀) can be obtained using Eq. (31). (See D. E. Knuth, “The Art OF Computer Programming” Vol. 2, pp. 336, Seminumerical Algorithms.

A concrete example will be described below. For integers

X ₀=24, Y ₀=9

the Euclidean algorithm performs such operations as follows:

X ₁ ←Y ₀=9, Y ₁ ←X ₀ mod Y ₀=6

X ₂ ←Y ₁=6, Y ₂ ←X ₁ mod Y ₁=3

X ₃ ←Y ₂=3, Y ₃ ←X ₂ mod Y ₂=0

As a result, gcd(X₀, Y₀)=gcd(X₃, Y₃)=gcd(3, 0)=3 is obtained.

An apparatus for implementing the Euclidean algorithm can be formed by a combination of dividing and multiplying devices.

(2) Binary GCD Algorithm

The binary GCD algorithm is a method that calculates the GCD through utilization of the following fact:

When X is odd and Y even: gcd(X, Y)=gcd(X, Y/2)

When X is even and Y odd: gcd(X, Y)=gcd(X/2, Y)

When X is odd and Y odd: gcd(X, Y)=gcd(X, Y−X)

When X is even and Y even: gcd(X, Y)=2gcd(X/2, Y/2)

That is, this method is based on the fact that the following equation holds true

gcd(X _(i+1) , Y _(i+1))=gcd(X _(i) , Y _(i))  (34)

for Xi+1 and Yi+1 which is available by performing the following processes when either Xi or Yi is odd.

When X _(i) is odd and Y _(i) even: X _(i+1) ←X _(i) ; Y _(i+1) ←Y _(i)/2  (A)

When X _(i) is even and Y _(i) odd: X _(i+1) ←X _(i)/2; Y _(i+1) ←Y _(i)  (B)

When X _(i) is odd and Y _(i) odd: X _(i+1) ←X _(i) ; Y _(i+1) ←Xi−Y _(i)/2  (C)

Xi and Yi are obtained from X₀ and Y₀ by repeated application of the above processes (A), (B) and (C).

Since

 gcd(X ₀ , Y ₀)=gcd(X ₁ , Y ₁)= . . . =gcd(X _(j), 0)=X _(j)

gcd(X₀, Y₀) can be obtained using Eq. (34). (See D. E. Knuth “The Art OF Computer Programming” Vol. 2,) pp. 339, Algorithms A concrete example will be described below. For integers

X ₀=24, Y ₀=9

the binary GCD calculating method performs such operations as follows:

X ₁ ←X ₀/2³=3, Y ₁ ←Y ₀=9

X ₂ ←X ₁=3, Y ₂←(Y ₁ −X ₁)/2=3

X ₃ ←X ₂=3, Y ₃←(Y ₂ −X ₂)/2=0

As a result, gcd(X₀, Y₀)=gcd(X₃, Y₃)=gcd(3, 0)=3 is obtained.

The binary GCD calculating method can be implemented by such a procedure as depicted in FIG. 10. This example uses variables U and V in correspondence with inputs X and Y, and executes the following processes.

Step S1: Set X and Y as initial values U and V, and set an initial value 1 in a shift count z.

Step S2: Make a check to see if U and V are both even, that is, if the least significant bit is “0.”

Step S3: If U and V are both even, then set U/2 and V/2 as U and V, respectively, to double the shift count (one-bit shift operation), and return to step S2.

Step S4: Make a check to see if V is even.

Step S5: If V is even, then set V/2 as V and return to step S4.

Step S6: If U odd, then make a check to see if U is even.

Step S7: If U is even, then set U/2 as U and return to step S6.

Step S8: If U and V are both odd, then make a check to see if U>V.

Step S9: If U>V, then set (U−V)/2 as V and return to step S4.

Step S10: If U≦V, then set (V−U)/2 as V.

Step S11: Make a check to see if V=0, if not, return to step S4.

Step S12: If V=0, then output U×z as the result of calculation of gcd(X, Y).

An apparatus for the binary GCD calculation can be configured only by division and multiplication by power of 2. The multiplication/division by power of 2 is equivalent to the one-bit shift operation, and hence it has the advantage of easy implementation by an electronic circuit or electronic computer. In the Euclidean algorithm and the binary GCD algorithm, when the input values X and Y are large integers, a bit shift operation, division and multiplication for the large integers are carried out a plurality of times. Now, consider the case of performing the binary GCD calculation for integers X and Y that can be expressed, for example, by 512 bits. The repeating number k of the loop in the binary GCD calculation is in the range of the size of the input value to twice the input size (in the range of 512 to 1024 times in this instance), and the binary GCD calculation method performs the bit shift operation k times and a subtraction a maximum of k times (k/2 times on average) (corresponding to step S9 or S10 in FIG. 10). The times for one bit shift operation and one addition/subtraction also increase in proportion to the bit size of the value which is calculated (U, V in this case). Accordingly, the reduction of the number of repetitions of large integer operation leads to speedup of the GCD calculation.

One possible method that has been proposed to reduce the number of repetitions of the large integer operation is to utilize a simulation algorithm described below. This conventional method does not involve the large integer operation, but instead simulates the GCD algorithm by a calculation using small integers in the loop and then carrying out large integer operations through the use of the value obtained by the simulation.

(3) Algorithm L

There has been proposed a method which applies the simulation algorithm to the Euclidean algorithm (see, for example, D. E. Knuth (Translated by Keisuke Nakagawa), “Quasi-Numerical Algorithm/Arithmetic Operation (THE ART OF COMPUTER PROGRMNG, Vol. 4) pp. 166, Algorithm L, Science-sha, 1986.)

A concrete example will be described below. In the algorithm L, for large integers

X ₀=91234567890123456789

Y ₀=2000000000000000001

values of their upper, for example, 4 digits and values with 1s added to the values of the 4 digits are determined as such small integers as follows:

x0₀=9123

x1₀=9124

y0₀=2000

y1₀=2001

Setting

X _(i+1) =Y _(i) ; Y _(i+1) =X _(i) mod Y _(i)

x0_(i+1) =y1_(i) ; y1_(i+1) =x0_(i) mod y1_(i)

x1_(i+1) =y0_(i) ; y0_(i+1) =x1_(i) mod y0_(i)

the following equation holds true:

x0_(i) /y1_(i) <X _(i) /Y _(i) <x1_(i) /y0_(i)  (35)

The algorithm L performs the Euclidean algorithm using x0_(i), y1_(i), x1_(i) and y0_(i), not X_(i) and Y_(i). That is, small integers x0_(i), y1_(i), x1_(i) and y0_(i) are calculated as long as the integral parts on the right and left sides of Eq. (35) have the same value. This is called a simulation. The values obtained by the simulation are used to calculate the large integers X_(i) and Y_(i).

This method produces the same effect as is obtainable by simultaneous execution of large integer operations. (For example, when the small integers x0_(i), x1_(i), y₀ _(i) and y1_(i) are 10-digit, operations of about 12 iterations can be performed at a time.) This method is applicable to the binary GCD calculation as well.

The problem of the algorithm L lies in that the simulation requires both of the Euclidean algorithm using x0_(i), y1_(i) and the Euclidean algorithm using x1_(i) and y0_(i) and that the number of operations which can be performed at a time varies for each input value.

An ordinary computer has storages capable of reading therefrom and writing thereto in units of M bits (where M is 8, 16, 32, . . . ) (Condition 1). Therefore, it would be efficient to perform operations in steps of M bits. For example, the binary GCD algorithm involves one-bit shift operations of large numbers. Under the condition 1, however, the cost of the one-bit-shift operation is equal to or higher than that of the M-bit-shift operation. Further, the present-day computer is provided with M-bit (where M is 8, 16, 32, . . . ) shifters, adders, subtractors and multipliers (Condition 2). In this instance, an under-M-bit operation takes the same amount of time as does the M-bit operation. Accordingly, it is preferable from the viewpoint of efficiency to perform operatins in units of M bits.

On the other hand, in the algorithm L the number of bits that can be processed simultaneously varies each time, impairing the merit of the combined operation. To avoid this, the extended binary GCD calculation according to the third embodiment applies the simulation method to the binary GCD algorithm—this can be realized without calculating an error range as described below.

The algorithm L performs the simulation using the small integers x0_(i), x1_(i), y0_(i) and y1_(i) instead of using X_(i) and Y_(i). The integers x0_(i) and x1_(i) represent the lower and upper limits of the value that X_(i) may take, and y0_(i) and y1_(i) the lower and upper limits of the value that Y_(i) may take. The simulation is continues until the difference between the upper and lower limits (the error range) grows to some extent.

In contrast thereto, in the extended binary GCD calculation method of this third embodiment the small integer representing the value X_(i) is limited specifically to the intermediate value x_(a) between the upper and lower limits. Further, the simulation is carried out a predetermined number of times w′ without calculating the error range.

This provides the two advantages mentioned below.

(1) Since a larger number of simulations can be carried out at a time than in the case of using the error range, the number of repetitions of the multi-precision calculation decreases accordingly.

(2) A bit-shift operation can be performed in units of a fixed number w′ of bits.

With these advantages, the binary GCD calculation becomes faster.

The algorithm L performs the same operation as those of the Euclidean algorithm and the binary GCD calculation method, but the extended binary GCD calculation method according to the third embodiment may sometimes perform different operations. For example, the binary GCD calculation method compares U and V in the loop to determine which value is larger. If the values U and V are far apart from each other, the comparison can be made by checking their several upper digits alone. With the values U and V close to each other, however, the comparison cannot be made sometimes based only on small integers u_(a) and v_(a) (corresponding to several upper digits of U and V) which are used to simulate the calculations of U and V. In such a situation, it is customary in the algorithm L to once end the simulation and recalculate the values U and V for a second comparison.

In the extended binary GCD calculation method of this embodiment, however, the simulation is continued even in such an instance. Accordingly, this method may sometimes make an error in determining which value is larger than the other. Such an error makes the values U and V negative. (This never happens in the algorithm L.) By setting gcd(U, V)=gcd(|U|.|V|), however, the extended binary GCD calculation method is prevented from outputting a wrong answer. With this scheme, as compared with the algorithm L, the extended binary GCD calculation method of this embodiment is large in the number of operations for simultaneous execution but small in the number of repetitions of the multi-precision calculation. Moreover, the calculation method of this embodiment permits calculations in blocks of a predetermined number of bits (w′ bits).

Algorithm for GCD Calculation

To facilitate a better understanding of the extended binary GCD calculation method of the third embodiment, a description will be given first of a calculation method which is used when the principle of the third embodiment is applied to an ordinary binary GCD calculation.

Step S1 (Multi-precision value initialization):

 U←Y; V←X; S←0; T←1

Step S2 (Single-precision value initialization): i ← max   (size  of  V; size  of  U) V_(a) ← upper  w  bits  of  V; u_(a) ← upper  w  bits  of  U V_(x) ← lower  w  bits  of  V; u_(x) ← lower  w  bits  of  U $\left. G\leftarrow\begin{bmatrix} 10 \\ 01 \end{bmatrix} \right.$ If  i ≤ w, then  go  to  step    S5.

Step S3 (Single-precision calculation loop): Repeat the following process w times. $\begin{matrix} (1) & {{{If}\quad u_{x}\quad {is}\quad {even}},} \\ \quad & {\left. u_{a}\leftarrow\left\lbrack {u_{a}/2} \right\rbrack \right.;\left. u_{x}\leftarrow{u_{x}/2} \right.;\left. G\leftarrow{\begin{bmatrix} 10 \\ 02 \end{bmatrix}G} \right.} \\ (2) & {{{If}\quad v_{x}\quad {is}\quad {even}},} \\ \quad & {\left. v_{a}\leftarrow\left\lbrack {v_{a}/2} \right\rbrack \right.;\left. v_{x}\leftarrow{v_{x}/2} \right.;\left. G\leftarrow{\begin{bmatrix} 20 \\ 01 \end{bmatrix}G} \right.} \\ (3) & {{{{If}\quad v_{x}\quad {and}\quad u_{x}\quad {are}\quad {odd}\quad {{an}d}\quad {if}\quad u_{a}} > v_{a}},} \\ \quad & {\left. u_{a}\leftarrow\left\lbrack {\left( {u_{a} - v_{a}} \right)/2} \right\rbrack \right.;\left. u_{x}\leftarrow{\left( {u_{x} - v_{x}} \right)/2} \right.;\left. G\leftarrow{\begin{bmatrix} 11 \\ 02 \end{bmatrix}G} \right.} \\ (4) & {{{{If}\quad v_{x}\quad {and}\quad u_{x}\quad {are}\quad {odd}\quad {and}\quad {if}\quad u_{a}} \leq v_{a}},} \\ \quad & {\left. v_{a}\leftarrow\left\lbrack {\left( {v_{a} - u_{a}} \right)/2} \right\rbrack \right.;\left. v_{x}\leftarrow{\left( {v_{x} - u_{x}} \right)/2} \right.;\left. G\leftarrow{\begin{bmatrix} 20 \\ 11 \end{bmatrix}G} \right.} \end{matrix}$

Step S4 (Multi-precision value recalculation): $\left. \begin{bmatrix} U^{\prime} \\ V^{\prime} \end{bmatrix}\leftarrow{G\begin{bmatrix} U \\ {- V} \end{bmatrix}} \right.$ U ← U^(′)/2^(w); V ← V^(′)/2^(w) If  V = 0, then  go  to  step  S5, otherwise, go  to  step  S2.

Step S5 (Final processing):

If V=0, then output U.

If V≠0, calculate and output gcd(U, V) (single-precision calculation with w or fewer bits)

Validity of the Algorithm

Lemma 1: When the above algorithm halts, it outputs gcd(X, Y).

Proof: The above algorithm always satisfies gcd(U, V)=gcd(X, Y).

This will be proved below by induction.

1. In step S1, since U=X and V=Y, gcd(U, V)=gcd(X, Y) holds true.

2. In steps S3 and S4, a calculation corresponding to any one of the following operations is carried out.

When U is even: U←U/2

When V is even: V←V/2

When U and V are both odd and U>V: U←(U−V)/2

When U and V are both odd and U≦V: V←(V−U)/2

That is, if gcd(U, V)=gcd(X, Y) at the beginning of step S3, then gcd(U<V)=gcd(X, Y) holds at the end of step S4, too. Here, gcd(U, V)=gcd(|U|, |V|).

Therefore, the above algorithm outputs gcd(X, Y) when it halts.

Grounds for Halt of the Above Algorithm

Lemma2: If w≧4, the above algorithm halts in finite time.

Proof: The values of U and V in step S2 are set as U₀ and V₀, respectively, and U and V are recalculated as U₁ and V₁ in step S4. At this time, the following equation needs only to be shown.

 U ₀ +V ₀ >U ₁ +V ₁

In the above algorithm U+V decreases monotonically, and when U+V<2w is obtained, step S5 is carried out, and the algorithm halts. The inventors can prove that the above equation holds, but no description will be given of the proof.

GCD Calculating Apparatus

Turning next to FIGS. 11 and 12, a GCD calculation apparatus 1000 will be described. The apparatus 1000 inputs thereinto X and Y via an input part 102 and outputs gcd(X, Y) via an output part 102. The apparatus 1000 comprises a GCD calculation initializing part 110, a GCD calculation simulating part 120, a GCD multi-precision calculating part 130, a GCD calculation final processing part 140, a control device 150 and a storage part 160, and performs such calculations as described below.

Step S1: The GCD calculation initializing part 110 performs, for inputs X and Y, the following operation

gcd(X, Y)=2^(z) ^(₀) gcd(U, V)  (36)

to find U and V which maximize z0, then provides U and V as U₀ and V₀, to the control device 150, and provides z₀ to the GCD calculation final processing part 140 through the control device 150.

Step S2: The control device 150 checks the inputs U₀ and V₀ to see if U₀=1 or V₀=1. If U₀=1 or V₀=1, then the control device 150 provides U₀ and V₀ to the GCD calculation final processing part 140.

Step S3: If not so, then the control device 150 calculates the bit size value i of that one of the inputs U₀ and V₀ which has a larger bit size.

Step S4: The control device 150 makes a check to see if the bit size i is smaller than the w-bit size. If so, the control device 150 provides U₀ and V₀ to the GCD calculation final processing part 140. If the bit size i is not smaller than the w-bit size, the following values are provided to the GCD calculation simulating part 120:

v _(a)=Upper w bits (i-th to (i−w+1)th bit) of V ₀

u _(a)=Upper w bits (i-th to (i−w+1)th bit) of U ₀

v _(x)=Lower w bits of V₀

u _(x)=Lower w bits of U₀

And U₀ and V₀ are provided to the GCD multi-precision calculating part 130.

Step S5: The GCD calculation simulating part 120 simulates the GCD calculation as described later on with reference to FIG. 15 and 16, using the values v_(a), u_(a), v_(x) and u_(x) which correspond to the upper and lower w bits of U₀ and V₀. The resulting values u_(u), u_(v), v_(u) and v_(v) are provided to the GCD multi-precision calculating part 130.

Step S6: The GCD multi-precision calculating part 130 calculates

U ₀ ←|u _(u) U ₀ −u _(v) V ₀|/2^(w); V₀ ←|v _(v) V ₀ −v _(u) U ₀|/2^(w)

and provides the calculation results as updated U₀ and V₀ to the control device 150.

Step S7: The control device 150 makes a check to see if V₀=0 and, if not, returns to step S3; if V₀=0, the control device 150 provides U₀ and V₀ to the GCD calculation final processing part 140.

Step S8: The GCD calculation final processing part 140 calculates 2^(z) ^(₀) gcd(U₀, V₀) from the inputs U₀, V₀ and z₀ and outputs it. If V₀=0, 2^(z) ^(₀) gcd(U₀, 0)=U₀2^(z) ^(₀) is output.

Accordingly, the control device 150 comprises: initial decision means 1-20 for making a check to see if U₀=1 or V₀=1; a bit size detecting means 1-30 for detecting the bit size value i of that one of the inputs V₀ and U₀ which has a larger bit size; a bit size checking means 1-40 for making a check to see if the bit size is smaller than w; final decision means 1-70 for making a check to see if V₀=0; and bit extracting means 1-41 for extracting the upper and lower w bits from the input V₀ and U₀ in step S4. Further, the GCD calculating apparatus 1000 is provided with a storage part 160 for storing various pieces of data and data necessary for calculations, control and so forth.

GCD Calculation Initializing Part 110

Referring to FIGS. 13 and 14, the operation of the GCD calculation initializing part 110 will be described below.

Step S1: Count-up parts 111 and 112 count the number of zeroes continuing from the least significant bits of the inputs X and Y, respectively, and outputs[ the count values x₀ and y₀ to a comparison part 113. (For example, when the binary representation of the input is 101000, the output is 3.)

Step S2: The comparison part 113 compares the input values x₀ and y₀, and outputs the smaller one as z₀.

Step S3: Power-of-2 division parts 114 and 115 are supplied with the inputs X and Y and z₀, and divide the input values X and Y by 2^(z0) and outputs the division results U₀ and V₀. The GCD calculation initializing part 110 outputs U₀, V₀ and z₀.

GCD Calculation Simulating Part 120

Referring next to FIGS. 15 and 16, the operation of the GCD calculation simulating part 120 will be described below.

Step S1: Upon inputting of the values v_(a), u_(a), v_(x) and u_(x) into a control part 121 from the control device 150, a memory 122 sends predetermined initial values of u_(u), u_(v), v_(u), v_(v) and c to the control part 121.

Step S2: when supplied with data α={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c}, the control part 121 makes a check to see if u_(x) is even. If so, the control part 121 sends the data α={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to a case-1 unit 123.

Step S3: When u_(x) is even, the case-1 unit 123 performs the following calculations:

u _(a) ←[u _(a)/2]; u _(x←u) _(x)/2

v _(u)←2v _(u) ; v _(v)←2v _(v)

and sends data α′={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to the control part 121.

Step S4: When u_(x) is not even, the control part 121 makes a check to see if v_(x) is even. If so, the control part 121 sends the data α={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to a case-2 unit 124.

Step S5: When u_(x) is odd and v_(x) even, the case-2 unit 124 performs the following calculations:

v _(a) ←[v _(a)/2]; v _(x) ←v _(x)/2

u _(u)←2u _(u) ; u _(v)←2u _(v)

and sends data α′={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to the control part 121.

Step S6: When u_(x) and v_(x) are both odd, the control part 121 compares u_(a) and v_(a). If u_(a)>v_(a), then the control part 121 sends the data α={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to a case-3 unit 125. When u_(x) and v_(x) are both odd and u_(a)≦v_(a), the control part 121 sends the data α={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to a case-4 unit 126.

Step S7: When u_(x) and v_(x) are both odd and u_(a)>v_(a), the case-3 unit 125 performs the following calculations:

u _(a)←[(u _(a) −v _(a))/2]; u _(x)←(u _(x) −v _(x))/2

u _(u) ←u _(u) +v _(u) ; u _(v) ←u _(v) +v _(v)

v _(u)←2v _(u) ; v _(v)←2v _(v)

and sends the data α′={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to the control part 121.

Step S8: When u_(x) and v_(x) are both odd and u_(a)≦v_(a), the case-4 unit 126 performs the following calculations:

u _(a)←[(v _(a) −u _(a))/2]; v _(x)←(v _(x) −u _(x))/2

v _(u) ←v _(u) +u _(u) ; v _(v) ←v _(v) +u _(v)

u _(u)←2u _(u) ; u _(v)←2u _(v)

and sends the data α′={v_(a), u_(a), v_(x), u_(x), u_(u), u_(v), v_(u), v_(v), c} to the control part 121.

Step S9: When the data α is processed in any one of the case-1 to case-4 units 123 to 126 and returned as α′ to the control part 121, which increments the value c by one.

Step S10: The control part 121 compares the values c and w′, and if c<w′, returns to step S2. If c=w′, the GCD calculation simulating part 120 provides {u_(u), u_(v), v_(u), v_(v)} to the GCD multi-precision calculating part 130.

The control part 121 is provided with: state decision means 6-21 for deciding which of the case units 123 to 136 is to perform processing according to the states of the input values u_(x), v_(x), u_(a) and v_(a); processing result storage means 6-22 for storing the processing results by the case-1 to case-4 units 123 to 126; counting means 6-23 for counting the repeating number c of processing; and process end decision means 6-24 for deciding whether to finish the processing, that is, for deciding whether or not c=w′.

The GCD calculation simulating part 120 determines whether U_(o) and V₀ are even or not based on the values u_(x) and v_(x) of their lower w bits, and compares U₀ and V₀ to determine which of them is larger based on the values u_(a) and v_(a) of their upper w bits. Based on such determination results, the GCD calculation simulating part 120 performs the same process as does the conventional binary GCD algorithm. This will readily be understood from a comparison between the procedure of FIG. 16 and the procedure of the conventional binary GCD algorithm depicted in FIG. 10. Further, the GCD calculation simulating part 120 is to calculate u_(u), u_(v), v_(u) and v_(v) which satisfy the following equation:

gcd(U ₀ , V ₀)=gcd(|u _(u) U ₀ −u _(v) V ₀|/2^(w′) , |v _(v) V ₀ −v _(u) U ₀|/2^(w′))  (37)

GCD Multi-Precision Calculating Part 130

Turning next to FIG. 17, the operation of the GCD multi-precision calculating part 130 will be described below.

In FIG. 17, the GCD multi-precision calculating part 130 is supplied with U₀ and V₀ from the control device 150 and u_(u), u_(v), v_(u) and v_(v) from the GCD calculation simulating part 120. Multipliers 13 a to 13 d calculate and output products u_(u)U₀, u_(v)V_(v), v_(u)U₀ and v_(v)V₀, respectively.

Subtractors 13 e and 13 f calculate and output differences U₁=u_(u)U₀−u_(v)V₀ and V₁=v_(v)V₀−v_(u)U₀ to absolute value calculators 13 g and 13 h, respectively.

The absolute value calculators 13 g and 13 h calculate absolute values of the inputs U₁ and V₁, and output them to power-of-2 dividers 13 i and 13 j, respectively.

The dividers 13 i and 13 j calculate divisions of the inputs |U₁| and |V₁| by power of 2^(w′), and provides the division results as outputs U₀ and v0 from the multi-precision calculating part 130.

The processes of the GCD multi-precision calculating part 130 depicted in FIG. 17 are listed below.

Step S1: Calculate

V ₁=(−v _(u) U ₀ +v _(v) V ₀)/2^(w′)

U ₁=(u _(u) U ₀ −u _(v) V ₀)/2^(w′)

Step S2: V₁←|V₁|; U₁←|U₁|

Step S3: V₀←V₁; U₀←U₁

In FIG. 17 the division by 2^(w′) is preceded by the calculation of the absolute value, but the former may also be followed by the latter as mentioned above in step S1. The outputs U₀ and V₀ from the GCD multi-precision calculating part 130 are input into the control device 150, in which a check is made to see if V₀=0 as described previously with reference FIG. 12.

GCD Calculation Final Processing Part 140

Referring next to FIG. 18, the operation of the GCD calculation final processing part 140 will be described below.

The GCD calculation final processing part 140 is supplied with U₀ and V₀ from the control device 150 and z₀ from the initializing part 110. A small-number GCD calculation part 141 calculates the GCD of the inputs U₀ and V₀ and provides it to a power-of-2 multiplication part 142. The multiplication part 142 uses the inputs gcd(U₀, V₀) and z0 to calculate 2^(z) ^(₀) gcd(U₀, V₀) and provides it as the output from the final processing part 140, that is, the output from the GCD calculating apparatus 1000.

The calculation procedure of the GCD calculation final processing part 140 is basically identical with that of the conventional binary GCD calculation method of FIG. 10 except the correction with multiplication by 2^(z) ^(₀) in the last step S10 as depicted in FIG. 19. In more detail, steps S1 to S9 in FIG. 19 are the same as the processes for u_(x), u_(u), v_(x), v_(u) and v_(v) in steps S1 to S9 in FIG. 16.

In the manner described above, the greatest common divisor for the inputs X and Y can be obtained. In addition, all the calculations except in the GCD calculation final processing part 140 are carried out in units of w or w′ bits; hence, the greatest common divisor can be calculated with a small number of processes as a whole. As will be understood from the description given previously with reference to FIGS. 11 and 12, the respective parts in FIG. 11 are sequentially processed, and accordingly, the GCD calculation simulating part 120 in FIG. 15 is shown to be provided with the control part 121 merely for convenience description. The control part 121 need not be provided in practice. The control device 150 in FIG. 11 can be used to perform the control function of the control part 121 and control other parts as well. The memories in the respective parts need not necessarily be provided, either; the storage part 160 in FIG. 11 can be used as a substitute for them to store data necessary for processing in the respective parts.

Extended Binary GCD Calculating Apparatus 2000

Turning next to FIG. 20, an extended binary GCD calculating apparatus 2000 will be described below. The apparatus 2000 is supplied with inputs X and Y, and outputs gcd(X, Y), S=2^(k)X⁻¹ mod Y, and k.

The apparatus 2000 comprises an extended binary GCD calculation initializing part 210, an extended GCD calculation simulating part 220, an extended GCD multi-precision calculation part 230, an extended GCD calculation final processing part 240, and a control device 250. The calculating apparatus 2000 performs the following calculations as depicted in FIG. 21.

Step S1: The extended GCD calculation initializing part 210 performs, for inputs X and Y, the following calculation

gcd(X, Y)=2^(z) ^(₀) gcd(U ₀ , V ₀)  (38)

to find U₀ and V₀ which maximize z0. The extended GCD calculation initializing part 210 provides the thus obtained U₀ and V₀, to the control device 250, together with initial values S₀=0, T₀=1 and k=0 of S, T and k and provides z₀ to the extended GCD calculation final processing part 240 through the control device 250.

Step S2: The control device 250 checks the inputs U₀, V₀, S_(o), T_(o) and k to see if U₀=1 or V₀=1. If U₀=1 or V₀=1, then the control device 250 provides U₀, V₀, S₀, T₀ and k to the extended GCD calculation final processing part 240.

Step S3: If not so, then the control device 250 calculates, for the inputs U₀, v₀, S₀, T₀ and k, the bit size value i of that one of the inputs U₀ and V₀ which has a larger bit size.

Step S4: The control device 250 makes a check to see if the bit size i is smaller than the w-bit size. If so, the control device 250 provides U₀, V₀, S₀, T_(o) and k to the extended GCD calculation final processing part 240. If the bit size i is not smaller than the w-bit size, the following values are provided to the extended GCD calculation simulating part 220:

v _(a)=Upper w bits (i-th to (i−w+1)th bits) of V ₀

u _(a)=Upper w bits (i-th to (i−w+1)th bits) of U ₀

v _(x)=Lower w bits of V₀

u _(x)=Lower w bits of U₀

And U₀, V₀, S₀, T₀ and k are provided to the extended GCD multi-precision calculating part 230.

Step S5: The extended GCD calculation simulating part 220 simulates an extended GCD calculation, using the values v_(a), u_(a), v_(x) and u_(x) which correspond to the upper and lower w bits of the inputs U₀ and V₀. The resulting values u_(u), u_(v), v_(u) and v_(v) are provided to the extended GCD multi-precision calculating part 230.

Step S6: The extended GCD multi-precision calculating part 230 performs the following operations as described later on with reference to FIG. 22.

U′=(u _(u) U ₀ −u _(v) V ₀)/2^(w′)

V′=(v _(v) V ₀ −v _(u) U ₀)/2_(w′)

S′=u _(u) S ₀ +u _(v) T ₀

T′=v _(v) T ₀ +v _(u) S ₀

If V′ is negative, then the signs of V′ and T′ are inverted, and if U′ is negative, then the signs of U′ and S′ are inverted. The values U′, V′, S′ and T′ obtained by the above operations are provided as U₀, V₀, S₀ and T₀ to the control device 250.

Step S7: The control device 250 makes a check to see if V₀=0 and, if not, returns to step S3. If V₀=0, the control device 250 goes to the processing of the extended GCD calculation final processing part 240.

Step S8: If V₀≠0, the extended GCD calculation final processing part 240 calculates 2^(z) ^(₀) gcd(U₀, V₀) from the inputs U₀, V₀ and z₀ and outputs it. If V₀=0, the extended GCD calculation final processing part 240 calculates S and k which satisfy S=2^(k)X⁻¹ mod Y, and output them.

Though not shown in particular in FIG. 20, this extended GCD calculating apparatus 2000 is also provided with means corresponding to the initial decision means 1-20, the bit size detecting means 1-30, the bit size checking means 1-40, the bit extracting means 1-41, the final decision means 1-70, and the storage part 160 all of which are depicted in FIG. 11.

The extended GCD calculation initializing part 210 has the functional configuration of FIG. 13 and performs the processes depicted in FIG. 14 as is the case with the GCD calculation initializing part 110 in FIG. 11; but the initializing part 210 differs in that it provides to the control device 250 the initial values S₀=0, T₀=1 and k=0 of S, T and k stored in the memory.

The extended GCD calculation simulating part 220 has the substantially the same functional configuration as that of the GCD calculation simulating part 120 depicted in FIG. 15 and performs substantially the same processes as shown in FIG. 16, but differs in the process of incrementing the value k by one as parenthesized in step S9 in FIG. 16. That is, the simulating part 220 outputs the value k+w, together with its calculated values u_(u), u_(v), v_(u) and v_(v). Accordingly, the control part of the extended GCD calculation simulating part 220 is provided with means for counting k. It is also possible to provide k+w=k when c=w in step S10 instead of incrementing k by one in step S9.

Extended GCD Multi-Precision Calculating Part 230

Turning now to FIGS. 22 and 23, the operation of the extended GCD multi-precision calculating part 230 will be described below.

The calculating part 230 is supplied with U₀, V₀, S₀ and T₀ from the control device 250 and u_(u), u_(v), v_(u) and v_(v) from the extended GCD calculation simulating part 220 in FIG. 20.

Multipliers 23 a to 23 h calculate and output products u_(u)U₀, u_(v)U₀, v_(v)V₀, u_(u)S₀, u_(v)T₀, v_(u)S₀ and v_(v)T₀, respectively.

Subtractors 23 i and 23 j calculate and output differences U′=u_(u)U₀−u_(v)V₀ and V′=v_(u)V₀−u_(v)U₀, respectively.

Adders 23 k and 23 l calculate and output sums S′=u_(u)S₀+u_(v)T₀ and T′=v_(v)T₀+v_(u)S₀, respectively.

A control part 23 m is supplied with the difference U′ and the sum S′ and if U′<0, outputs U′ and S′ to a sign inverter 23 o and receives therefrom −U′ and −S′ as new inputs U″ and S″. If U′≧0, then the control part 23 m outputs U′ to a power-of-2 divider 23 q, and outputs S′ as S₀ from the calculating part 230.

A control part 23 n is supplied with the difference V′ and the sum T′, and if V′<0, outputs U′ and S′ to a sign inverter 23 p and receives therefrom −V′ and −T′ as new inputs V″ and T″. If V′≧0, then the control part 23 n outputs V′ to a power-of-2 divider 23 r, and outputs T′ as T₀ from the calculating part 230.

The divider 23 q calculates a quotient U₁ by 2^(w′) of the input U′ and provides it as an output U₀ from the calculating part 230. The divider 23 r similarly calculates a quotient V₁ by 2^(w′) of the input V′ and provides it as an output V₀ from the calculating part 230.

Listed below is the processes of the extended GCD multi-precision calculating part 230 described above.

Step S1: Calculate

V ₁=(−v _(u) U ₀ +u _(v) V ₀)/2^(w′)

U ₁=(−u _(u) U ₀ +u _(v) V ₀)/2^(w′)

S ₁=(u _(u) S ₀ +u _(v) T ₀)

 T ₁=(v _(u) S ₀ +v _(v) T ₀)

Step S2: Determine whether V₁ is smaller than 0, and if not, go to step S4.

Step S3: If V₁ is smaller than 0, change the sign S of V₁ and T₁ by V₁←−V₁ and T₁←−T₁.

Step S4: Determine whether U1 is smaller than 0, and if not, go to step S6.

Step S5: If U₁ is smaller than 0, change the signs of U₁ and S₁ by U₁←−U₁ and S₁←−S₁.

Step S6: Output the thus obtained values V₁, U₁, S₁ and T₁ as updated V₀, U₀, S₀ and T₀.

The output from the extended GCD multi-precision calculating part 230 is input into the control device 250.

Extended GCD Calculation Final Processing Part 240

The extended GCD calculation final processing part 240 has substantially the same functional configuration as that of the final processing part 140 depicted in FIG. 18. As is the case with the processing part 140, the processing part 240 calculates gcd(U, V) using the inputs U₀ and V₀ as initial values, then calculates 2^(z) ^(₀) gcd(U, V) using calculation result gcd(U, V) and z0, and outputs it. The processing part 240 differs from the processing part 140 in the processes mentioned below. The final processing part 240 is supplied with S₀, T₀ and k as well, and as FIG. 24 shows part of the GCD calculation procedure of FIG. 19, it performs a step S8-1 of incrementing the value k by one after steps S3, S5, S7 and S8, and goes to step S9. If v_(x)=0 in step S9, S=(u_(u)S₀+u_(v)T₀) is calculated in step S9-1, and the calculation result S and k are output. The calculation result S agrees with that of S=2^(k)X⁻¹ mod Y.

As is the case with the GCD calculating apparatus 1000, the extended GCD calculating apparatus 2000 permits execution of the calculation processes of its respective parts under the control of one control device 250. These calculation processes may also be carried out under program control. This performs, for each process, the steps of reading out necessary data from storage means, fetching temporarily stored data from a buffer, writing calculation results in storage means, temporarily storing them in a buffer, and so forth. This embodiment is adapted to output gcd(X, Y) 2^(z) ^(₀) u_(x) when the inputs X and Y are both even, and S and k when either X or Y is odd and gcd(X, Y)=1. Hence, the extended GCD calculation initializing part 210 may be modified such that it first determines which of the inputs X and Y is odd and, if odd, does not calculate z0 but instead outputs w, S₀=0, T₀=1 and k=0, using X as U₀ and Y as V₀. However, a modular inverse cannot be obtained unless either one of the inputs X and Y is odd. That is, when it is preknown that either one of the input values is odd, the extended GCD calculation initializing part 210 needs only to initialize U₀=X, V₀=Y, S₀=0, T₀=1 and k=0; namely, it needs only to use X as U₀ and Y as V₀ and read out S₀=0, T₀=1 and k=0 from a memory and output them.

While in the above the number of bits that can be calculated at a time has been described to be w and w′, the amount w′ of simultaneous operation in the simulating part (120, 220) and that w in the multi-precision calculating part (130, 230) may be chosen equal.

As referred previously, the extended binary GCD calculating apparatus can be combined with a power-of-2 division device into an apparatus for inversion over the Z/NZ. FIG. 25 illustrates in block form an ordinary inversion apparatus using the extended binary GCD calculating apparatus of the third embodiment of the present invention. As depicted in FIG. 25, integers X and N are input into the apparatus, denoted generally by 3000, in which the extended binary GCD calculating apparatus 315, described previously with reference to FIG. 20, performs an extended binary GCD calculation and outputs S=X⁻¹2^(k) mod N and k. The outputs S and k are input into a division device 318 by power of 2 over the ring Z/NZ, which calculates S2^(−k) mod N, and from which X⁻¹ mod N, that is, the result of inversion of X over the ring Z/NZ is obtained.

In FIG. 26 there is depicted an inversion apparatus 3100 which applies the extended GCD calculation method of the third embodiment of the invention to the Kalishi inversion. The integers X and N are input into the apparatus 3100, in which the extended GCD calculating apparatus 315 described previously in respect of FIG. 20 performs a calculation for the inputs X and N and outputs S=X⁻¹2^(k) mod N and k. The calculation results S and k and the input N are provided to a division device 320 by the power of 2 over the ring Z/NZ, which calculates S2^(−(k−n)) mod N (where n is the number of bits of the input N) and from which X⁻¹2n mod N is provided as the calculation result.

In FIG. 27 there is illustrated in block form an inversion apparatus 3200 which applies the extended binary GCD calculation method of the third embodiment to the Montgomery inversion over the Z/NZ. As depicted, the extended GCD calculating apparatus 315 calculates S=X⁻¹2^(k) mod N and k for the input integers X and N, and a multiplication device 325 by power of 2 over the Z/NZ calculates S2^(2n−k) mod N using the calculation results S and k, providing X⁻¹2^(2n) mod N.

In FIG. 28 there is illustrated in block form a modular inversion apparatus 5000 which applied the extended GCD calculation method of the third embodiment to the Montgomery inversion method on the Z/NZ according to the first embodiment of the invention. As depicted in FIG. 28, under the control of a control part 510 a division device 515 by power of 2 over the ring Z/NZ calculates X′=X2⁻¹ mod N, and for its calculation result X′ and the input N, an extended GCD calculating device 515 calculates S=X⁻¹2^(k) mod N and k. The calculation result X′ corresponds to Y in FIGS. 1 and 2. These values S and k are input into a comparison device 517, which uses the bit length n of the input N, k and t to determine whether 2n−k−t is positive or negative. If it is negative, then k′=−2n+k+t and S′=S are input into a division device 518A by power of 2 over the ring Z/NZ to calculate T=S′2^(−k′) mod N. If 2n−k−t is positive, then k′=2n−k−t and S′=S are input into a multiplication device 518B by power of 2 over the ring Z/NZ to calculate T=S′2^(k′) mod N. An output part 519 outputs T from either one of the division device 518A and the multiplication device 518B as the calculation result of X⁻¹2^(2n) mod N.

Next, a description will be given, with reference to FIG. 29, of the actual use of a program for the modular inversion according to the present inversion described above. The program is stored, for example, on a main storage 13 in an arithmetic unit 10A. The arithmetic unit 10A is implemented, for example, by a computer, and is composed of a CPU 11, a RAM 12 and the main storage 13. A keyboard 14 and a display unit 15 are connected to the arithmetic unit 10A. For example, in the case for using, as the CPU 11, a 16-bit chip set which performs an operation in an units of 16 bits at a time, it is preferable that multiplication and division by power of 2 be carried out in unit of 16 bit s as described above in respect of the embodiments of the present invention.

The CPU 11 performs the modular inversion following the operation program stored on the main storage 13. The RAM 12 stores various parameters and variables necessary for the modular inversion and intermediate and final results of operation. A user A enters a program executing instruction from the keyboard 14, and the progress of operation is displayed on the display unit 15.

Now the modular inversion method according to the present invention will be described as being applied to the digital signature scheme which is one of information security techniques. The arithmetic unit 10A of the user A is connected to an arithmetic unit 10B of a user B, for example, via a network NW. The user A sends a message m affixed with a digital signature S to the arithmetic unit 10B of the user B, who verifies the validity of the signature S attached to the received message m. This example will be described on the assumption of using the aforementioned digital signature system ESGN. In this instance, the users A and B share a public key n and a system parameter k, and the user A at the sending side secretly holds secret keys p and q that are primes, where n=pq.

A program 13P for executing the digital signature system ESGNis stored in the main storage 13. The program 13P contains a subprogram 13PP which is used to calculate, by the method of the present invention, Eq. (b-1) containing the modular inversion which is used in one process of the digital signature generation.

To begin with, the arithmetic unit 10A of the user A generates a random number x, then puts the message m in a hash function to generate h(m), and performs the following calculation:

w=[{h(m)−x ^(k) mod n}/pq  (39)

After this, the following calculation is performed:

S=x+{w/(kx ^(k−1))mod p}pq  (40)

w/(kx^(k−1))mod p in Eq. (40) is the same as the modular inversion described previously in respect of Eq. (b-1). Hence, expressing

y=w/(kx ^(k−1))mod p=wX ⁻¹ mod p  (41)

as described previously, the value y can be obtained by the modular inversion procedure depicted in FIG. 1. The value y thus obtained is used to calculate

S=x+ypq  (42)

And (S,m) is sent to the arithmetic unit 10B of the user B.

The arithmetic unit 10B of the user B uses the received signature S and message m to verify whether the following equation holds true:

S ^(k)−2^(a) ≦h(m)≦S ^(k), where a=[(2/3)log₂ n]  (43)

If the above equation holds true, then it is recognized that the signature S attached to the message m is true or valid.

While in the above the program for executing the modular inversion according to the present invention has been described to be stored in the main storage 13 of the arithmetic unit which is used as a recording medium, it is evident that the program may be stored in any other types of recording media.

EFFECTS OF THE INVENTION

As described above, the conventional methods for calculating the Montgomery inverse through utilization of the extended binary GCD algorithm are Method 1 which requires time-consuming multiplication by power of 2 and Method 2 which involves only division by power of 2 but possesses a shortcoming that the number of repetitions of elementary operation is 2.3 times larger than that in Method 1 on average.

The present invention realizes the calculation method that has the advantages of both Methods 1 and 2, by predicting the repeating number of the loop for the extended binary GCD calculation.

With the method according to the present invention, it is possible to make, for example, a 256-bit Montgomery inversion about 40% faster than by the conventional Method 2 (except the binary GCD calculation).

According to the second embodiment, in the multiplication and division for modular inversion, combining w-bit (where w is the number of bits that the computer can handle at a time, for example, 8, 16, 32, etc.) calculations permits reduction of large integer calculations in a rate proportional to 1/w, permitting speedup of the multiplication and division by 2^(k) on the Z/NZ.

This brings about such effects as mentioned below. The conventional methods perform, for n-bit inputs S and N, a multi-precision bit shift operation k times and a multi-precision addition (subtraction) k/2 times on average. In contrast thereto, the apparatus of FIG. 3, which is an example of the second embodiment, performs, for the n-bit inputs S and N, the multi-precision bit shift operation k/w times, a single- and multi-precision multiplication k/w times, an addition k/w times, and a single-precision multiplication k/w times. The single-precision calculation causes an error if w is smaller than N. Assuming that single-precision calculations (bit-shift operation, addition and multiplication) takes exactly the same amount of time, the computing time will become 2/w. That is, in a 16-bit computer the computing speed increases around eight-fold if the value N is sufficiently large.

In the extended binary GCD algorithm according to the third embodiment which is applicable to the modular inversion, the simulation of the binary GCD by the small integer calculation reduces the large integer calculation in a rate proportional to 1/w, making the binary GCD calculation faster.

Moreover, the simulation efficiency is improved by the introduction of the method which “performs simulation a predetermined number of times even with no assurances of correct simulation of the actual GCD algorithm.”

For example, the conventional algorithm L performs simulation of about 12 loops by a simulation method using a 32-bit single-precision integer. With such a method of the present invention as mentioned above, however, it is possible to perform 32-loop simulation by the simulation method using the 32-bit single-precision integer. In this instance, the repeating number of the large integer operation for the GCD calculation can be reduced more than one-half that in the case of the algorithm L.

It will be apparent that many modifications and variations may be effected without departing from the scope of the novel concepts of the present invention. 

What is claimed is:
 1. A method of calculating modular inversion R of an input value X over a residue class ring Z/NZ or finite field GF(p) for information security service, comprising the steps of: (a) calculating Y for input values X and N given as pieces of security information, by the following equation using a predetermined value t Y=X2^(−t) mod N; where said N is a part of cryptographic key information employed in the security service, the input value X is calculated from an encrypted message, a digital signature, a random number or a message to be encrypted and the bit size of each of said X and N is n and said X is equal to or greater than 0 and less than said N, n being an integer equal to or greater than 1; (b) calculating S and k for said Y and N by an extended GCD method expressed by bgcd (Y,N) defined as follows: S=bgcd(Y, N)=Y ⁻¹2^(k) mod N; and (c) performing the following calculation using said S, k and t R=S2^(−(k+t−m)) mod N where m=0, n, or 2n and outputting said R as the result of said modular inversion of said input value X to be used for calculation of an encrypted message, a decrypted message or a digital signature in the information security service.
 2. The method of claim 1, wherein said step (c) includes a step of determining whether k+t−m is positive or negative and calculating R=S2^(−(k+t−m)) mod N or R=S2^(k+t−m) mod N, depending on whether said k+t−m is positive or negative.
 3. The method of claim 1 or 2, wherein the value of said parameter t is in the range of 0.6n+20≦t≦0.54n−20.
 4. The method of claim 3, wherein the value of said parameter t is an integral multiple of the number of bits which a calculation apparatus used processes at a time.
 5. The method of claim 1, wherein: said information security service utilizes an elliptic curve E/GF(p) over GF(p); said modular inversion is a modular inversion in the calculation of λ in the following equations for calculating from two points (x₁, y₁) and (x₂, y₂) on said elliptic curve E/GF(p), a point (x₃, y₃) of the sum of said two points λ=(y ₂ −y ₁)/(x ₂ −x ₁)mod p x ₃=λ² −x ₁ −x ₂ mod p y ₃=λ(x ₁ −x ₃)−y ₁ mod p, said λ being expressed by the following equation with y=y₂−y₁ and X=x₂−x₁ λ=(y₂−y₁)(x₂−x₁)⁻¹ mod p=yX⁻¹ mod p; said step (a) is a step of calculating Y by the following equation Y=X2^(−t) mod p; said step (b) is a step of calculating S and k by the following equation using said Y and p S=bgcd(Y, p)=Y ⁻¹2^(k) mod p; and said step (c) is a step of calculating a modular inverse X′ by the following equation using said S and t X′=S2^(−(k+t−m)) mod p, where m=0, n or 2n and calculating λ by the following equation using said modular inverse X′ λ=yX′ mod p.
 6. The method of claim 1, wherein: said information security service utilizes a digital signature scheme ESIGN; and, letting the following equation, which is part of a digital signature generating process, y=w/(kx ^(k−1))mod p where: x, k, w are integers satisfying 0<x<pg, 0≦w<p, p and q being primes be represented by the following equation y=w/(kx ^(k−1))mod p=wX ⁻¹ mod p: said step (a) is a step of calculating X=kx^(k−1) and then calculating Y by the following calculation with X′=X⁻¹ mod p Y=X2^(−t) mod p; said step (b) is a step of calculating S and k by the following equation using said Y and p S=bgcd(Y, p)=Y ⁻¹2^(k) mod p; and said step (c) is a step of calculating a modular inverse X′ by the following equation using said S and t X′=S2^(−(k+t−m)) mod p, where m=0, n or 2n and performing the following equation using said modular inverse X′ y=wX ⁻¹ mod p=wX′ mod p.
 7. The method of claim 1, wherein: said information security service utilizes a digital signature scheme RSA; and setting R=r⁻¹ mod N in the following equation which is part of a blind signature generating process, s′=(r ^(e) m)^(d) mod N s=s′/r mod N where r, m, d, e are integers satisfying 0<r, m<N and 0<e, d<ø (N): said step (a) is a step of calculating Y by the following calculation Y=r2^(−t) mod N; said step (b) is a step of calculating S and k by the following equation using said Y and N S=bgcd(Y, N)=Y ⁻¹2^(k) mod N; and said step (c) is a step of calculating a modular inverse R by the following equation using S and t R=S2^(−(k+t−m)) mod N, where m=0, n, or 2n and performing the following equation using said modular inverse R s=s′/r mod N=s′R mod N.
 8. The method of claim 1, wherein, setting k′=k+t−m, said step (c) comprises the steps of: (c-1) calculating w′=k′ mod w, where w is the number of bits which are processed at a time in said modular division by power of 2 and is less than k′; (c-2) calculating n′=−N⁻¹ mod 2^(w); (c-3) calculating s′=Sn′ mod 2^(w); (c-4) calculating q=S+s′N; (c-5) calculating q/2^(w); (c-6) executing said steps (c-3), (c-4) and (c-5) K=[k′/w] times, further executing said steps (c-3), (c-4) and (c-5) once again after replacing said w with w′, and for each round of K+1 executions of said steps, updating said S with the calculation result by said step (c-5), the notation [a] representing a maximum integer not exceeding a given real number a; and (c-7) outputting, as said modular inverse R, the calculation result by said step (c-5) in the last round of said K+1 executions.
 9. The method of claim 1, wherein: a precalculated value n′=−N⁻¹ mod 2^(w) is prestored in storage means; and, setting k′=k+t−m, said step (c) comprises the steps of: (c-1) calculating w′=k′ mod w, where w is the number of bits which are processed at a time in said modular division by power of 2 and is less than k′; (c-2) calculating s′=Sn′ mod 2^(w): (c-3) calculating q=S+s′N; (c-4) calculating q/2^(w); (c-5) executing said steps (c-2), (c-3) and (c-4) K=[k′/w] times, further executing said steps (c-2), (c-3) and (c-4) once again after replacing said w with w′, and for each round of K+1 executions of said steps, updating said S with the calculation result by said step (c-4), the notation [a] representing a maximum integer not exceeding a given real number a; and (c-6) outputting, as said modular inverse R, the calculation result by said step (c-4) in the last round of said K+1 executions.
 10. The method of claim 1, wherein said step (a) comprises the steps of: (a-1) calculating w′=t mod w, where w is the number of bits which are processed at a time in said modular division by power of 2 and is less than t; (a-2) calculating n′=−N⁻¹ mod 2^(w); (a-3) calculating s′=Xn′ mod 2^(w); (a-4) calculating q=X+s′N; (a-5) calculating q/2^(w); (a-6) executing said steps (a-3), (a-4) and (a-5) K=[k/w] times, further executing said steps (a-3), (a-4) and (a-5) once again after replacing said w with w′, and for each round of K+1 executions of said steps, updating said S with the calculation result by said step (a-5), the notation [a] representing a maximum integer not exceeding a given real number a; and (a-7) outputting, as said modular inverse R, the calculation result by said step (a-5) in the last round of said K+1 executions.
 11. The method of claim 1, wherein: a precalculated value n′=−N⁻¹ mod 2^(w) is prestored in storage means; and said step (a) comprises the steps of: (a-1) calculating w′=t mod w, where w is the number of bits which are processed at a time in said modular division by power of 2 and is less than t; (a-2) calculating s′=Xn′ mod 2^(w); (a-3) calculating q=X+s′N; (a-4) calculating q/2^(w); (a-5) executing said steps (a-2), (a-3) and (a-4) K=[k/w] times, further executing said steps (c-2), (c-3) and (c-4) once again after replacing said w with w′, and for each round of K+1 executions of said steps, updating said S with the calculation result by said step (a-4), the notation [a] representing a maximum integer not exceeding a given real number a; and (a-6) outputting, as said modular inverse R, the calculation result by said step (a-4) in the last round of said K+1 executions.
 12. The method of claim 1, wherein, setting k′=−(k+t−m), said step (c) comprises the steps of: (c-1) calculating w′=k′ mod w, where w is the number of bits which are processed at a time in said modular multiplication by power of 2 and is less than or equal to M; (c-2) calculating n″=[2^(n+M−1)/N], where M is the number of bits that a calculation apparatus used processes at a time; (c-3) obtaining the value s of upper M bits of said S and calculating t′=[sn″/2^(2M−w−1)], the notation [a] representing a maximum integer not exceeding a given real number a; (c-4) calculating S′=S2^(w)−t′N; (c-5) comparing said S′ and N and, if S′>N, repeating updating S′←S′−N to obtain S′ which satisfies 0≦S′<N; (c-6) executing said steps (c-3), (c-4) and (c-5) K=[k′/w] times, further executing said steps (c-3), (c-4) and (c-5) once again after replacing said w with w′, and for each round of K+1 executions of said steps, updating said S with S′−N obtained at that time; and (c-7) outputting, as said modular inverse R, the calculation result S′ by the last round of said K+1 executions.
 13. The method of claim 1, wherein: a precalculated value n″=[2^(n+M−1)/N] is prestored in storage means; and, setting k′=−(k+t−m), said step (c) comprises the steps of: (c-1) calculating w′=k′ mod w, where w is the number of bits which are processed at a time in said modular division by power of 2 and is less than or equal to M, where M is the number of bits which a calculating apparatus used processes at a time; (c-2) obtaining the value s of upper M bits of said S and calculating t′=[sn″/2^(2M−w−1)], the notation [a] representing a maximum integer not exceeding a given real number a; (c-3) calculating S′=S2^(w)−t′N; (c-4) comparing said S′ and N and, if S′>N, repeating updating S′←S′−N to obtain S′ which satisfies 0≦S′<N; (c-5) executing said steps (c-2), (c-3) and (c-4) K=[k′/w] times, further executing said steps (c-2), (c-3) and (c-4) once again after replacing said w with w′, and for each round of said K+1 executions of said steps, updating said S with S′−N obtained at that time; and (c-6) outputting, as said modular inverse R, the calculation result S′ by the last round of said K+1 executions.
 14. The method of claim 1, wherein said t is equal to a predetermined number of w bits and said input values X and N are expressed in units of said predetermined number w of bits, said step (a) comprising the steps of: (a-1) calculating n′=−N mod 2^(w); (a-2) calculating s′=Xn′ mod 2^(w) from said n′ and X; (a-3) calculating q=X+s′N from said s′, X and N; (a-4) calculating division q/2^(w) from said q and w; (a-5) executing said steps (a-2), (a-3) and (a-4) K=the number of times using the calculation result of said step (a-4) as an updated value X; and (a-6) further executing said steps (a-2), (a-3) and (a-4) with k mod w as an updated w using said X obtained in said step (a-5), and outputting the resulting value as the result Y.
 15. The method of claim 1, where said t is equal to a predetermined number w of bits and said input values X and N are expressed in units of said predetermined number w of bits, a precalculated value n′=−N⁻¹ mod 2^(w) being prestored in storage means, said step (a) comprising the steps of: (a-1) calculating s′=Xn′ mod 2^(w) from said n′ and X; (a-2) calculating q=X+s′N from said s′, X and N; (a-3) calculating division q/2^(w) from said q and w; (a-4) executing said steps (a-1), (a-2) and (a-3) K=the number of times using the calculation result of said step (a-3) as an updated value X; and (a-5) further executing said steps (a-2), (a-3) and (a-4 ) with k mod w as an updated w using said X obtained in said step (a-4), and outputting the resulting value as a result Y.
 16. The method of claim 1, where said t is equal to a negative integer equal to −w, said w being a predetermined number of bits, and said input values X and N are expressed in units of said predetermined number w of bits, letting the number of bits which are processed at a time by hardware for said modular inversion be represented by M, said step (a) comprising the steps of: (a-1) calculating n′=[2^(n+M−1)/N], the notation [a] representing a maximum integer not exceeding a given real number a; (a-2) calculating t′=[sn′/2^(M−w−1)] using said n′ and the value s of upper M bits of said X; (a-3) calculating S′=X2^(w)−t′N from said X, N, t′ and w; (a-4) comparing said S′ and N, and if S′>N, repeating updating S′←S′−N to obtain S′ which satisfies 0≦S′<N as an updated value S′, and if S′≦N, obtaining said value S′ as an updated value S′; (a-5) executing said steps (a-2), (a-3) and (a-4) K=[k/w] times using said S′ obtained in said step (a-4); and (a-6) further executing said steps (a-2), (a-3) and (a-4) with k mod w as an updated value w using said value S′ obtained in said step (a-5), and outputting the resulting value S′ as the result Y.
 17. The method of claim 1, where said t is equal to a predetermined number of bits, said input values X and N are expressed in units of said predetermined number w of bits, in which, letting the number of bits which are processed at a time by hardware for said modular inversion, a precalculated value n′=[2^(n+M−1)/N] is prestored in storage means, said step (a) comprising the steps of: (a-1) calculating t′=[sn′/2^(2M−w−1)] using said n′ and the value s of upper M bits of said X; (a-2) calculating S′=X2^(w)−t′N from said X, N, t′ and w; (a-3) comparing said S′ and N, and if S′>N, repeating updating S′←S′−N to obtain S′ which satisfies 0≦S′≦N as an updated value S′, and if S′>N, obtaining said value S′ as an updated value S′; (a-4) executing said steps (a-1), (a-2) and (a-3) K=[k/w] times using said S′ obtained in said step (a-3 ); and (a-5) further executing said steps (a-1), (a-2) and (a-3) with k mod w as an updated value w using said value S′ obtained in said step (a-4), and outputting the resulting value S′ as the result Y.
 18. An apparatus for modular inversion R over a residue ring Z/NZ or finite field GF(p) for information security service, said apparatus comprising: input means for inputting values X and N given as pieces of security information, where the input value X is calculated from an encrypted message, a digital signature, a random number or a message to be encrypted said N is a part of cryptographic key information employed in the security service and the bit size of each of said X and N is n and said X is equal to or greater than 0 and less than said N, n being an integer equal to or greater than 1; N storage means for storing said value N; t storage means for storing a preset parameter t; dividing means by power of 2 for calculating Y=X2^(−t) mod N for said input values X and N; extended binary GCD calculating means for performing the following extended binary GCD algorithm: S=Y ⁻¹2^(k) mod N; using said calculation result Y and said input value N to obtain S and k, calculating means by power of 2 for performing the following equation using said calculation results S and k and said parameter t, R=S2^(−1(k+t−m)) mod N where m=0, n, or 2n; and output means for outputting said calculation result R as the modular inverse of said input value X to be used for calculation of an encrypted message, a decrypted message or a digital signature in the information security service.
 19. The apparatus of claim 18, wherein said calculating means by power of 2 comprises: comparison means for determining whether m−k−t is positive or negative; and means which, if said determination result is negative, calculates R=S2−^((m−k−t)) mod N and, if said determination result is positive, calculates R=S2^(m−k−t) mod N.
 20. The apparatus of claim 18, wherein: said information security service utilizes an elliptic curve E/GF(p) over GF(p); said modular inversion is a modular inversion in the calculation of λ in the following equations for calculating, from two points (x₁, y₁) and (x₂, y₂) on said elliptic curve E/GF(p), a point (x₃, y₃) of the sum of said two points λ=(y ₂ −y ₁)/(x ₂ −x ₁)mod p x ₃=λ² −x ₁ −x ₂ mod p y ₃=λ(x ₁ −x ₃)−y ₁ mod p and, letting said λ be represented by the following equation with y=y₂−y₁ and X=x₂−x₁ λ=(y₂−y₁)(x₂−x₁)⁻¹ mod p=yX⁻¹ mod p: said input means inputs p as said N; said dividing means by power of 2 calculates Y for said X and p by the following calculation Y=X2^(−t) mod p: said extended GCD calculating means calculates S and k by the following equation using said Y and p S=bgcd(Y,p)=Y ⁻¹2^(k) mod p; and said calculating means by power of 2 calculates a modular inverse X′ by the following equation using said S and t X′=S2^(−(k+t−m)) mod p, where m=0, n or 2n and calculates λ by the following equation using said modular inverse X′ λ=yX′ mod p.
 21. The apparatus of claim 18, wherein: said information security service utilizes a digital signature scheme ESIGN; and, letting the following equation, which is part of a digital signature generating process, y=w/(kx ^(k−1))mod p where x, k, w are integers satisfying 0<x<pq, 0≦w<p, p and q being primes be represented by the following equation y=w/(kx ^(k−1))mod p=wX ⁻¹ mod p: said input means includes means for calculating X=kx^(k−1), and inputs p as said value N; said dividing means by power of 2 calculates Y by the following equation with X′=X⁻¹ mod p, Y=X2^(−t) mod p; said extended binary GCD calculating means calculates S and k by the following equation using said Y and p S=bgcd(Y, p)=Y ⁻¹2^(k) mod p; and said calculating means by power of 2 calculates a modular inverse X′ by the following equation using said S and t X′=S2^(−(k+t−m)) mod p, where m=0, n or 2n, and performing the following equation using said modular ø inverse X′ y=wX ⁻¹ mod p=wX′ mod p.
 22. The apparatus of claim 18, wherein: said information security service utilizes a digital signature scheme RSA; and, setting R=r⁻¹ mod N in the following equation which is part of a blind signature generating process s′=(r ^(e) m)^(d) mod N s=s′/r mod N where r, m, e, d are integers satisfying 0<r, m<N and 0<e, d<ø(N) said input means inputs x as said value X and stores it in said storage means; said dividing means by power of 2 calculates Y by the following equation Y=r2^(−(k+t−m)) mod N where m=0, n or 2n; said extended binary GCD calculating means calculates S and k by the following equation using said Y and N S=bgcd(Y, N)=Y ⁻¹2^(k) mod N; and said calculating means by power of 2 calculates a modular inverse R by the following equation using said S and t R=S2^(−(k+t−m)) mod N where m=0, n or 2n and performs the following equation using said modular inverse R s=s′/r mod N=s′R mod N.
 23. The apparatus of claim 18, where said t is equal to a predetermined number w of bits, said input values X and N are expressed in units of w bits, said dividing means by power of 2 comprising: X and N storage means for storing said input values X and N, respectively; modular inverse calculating means for performing the following equation, the number M of bits which said division apparatus processes on hardware at a time being set as M=w; n′=−N ⁻¹ mod 2^(w); modular multiplication means for performing the following equation using said n′, said X and said w s′=Xn′ mod 2^(w); multiply/add means for performing the following equation for said N, said X and said s′ q=X+s′N; and dividing means for calculating q/2^(−w) for said q and said w, and for outputting the calculation result as the result Y of calculation of X2^(−w) mod N.
 24. The apparatus of claim 18, where said t is equal to predetermined number w of bits, said input values X and N are expressed in units of w bits, said division apparatus comprising: X and N storage means for storing said input values X and N, respectively; n′ storage means for storing a precalculated value n′=−N mod 2^(w), the number M of bits which said division apparatus processes on hardware at a time being set as M=w; modular multiplication means for performing the following equation using said n′, said X and said w s′=Xn′ mod 2^(w); multiply/add means for performing the following equation for said N, said X and said s′ q=X+s′N; and dividing means for calculating q/2^(−w) for said q and said w, and for outputting the calculation result as the result Y.
 25. The apparatus of claim 23, wherein said modular inverse calculating means comprises: means for calculating y=N mod 2^(w) for said N and said w; and means for calculating n′=−y⁻¹ mod 2^(w) for said y and said w.
 26. The apparatus of claim 23, wherein said modular inverse calculating means comprises: n′ storage means for storing said calculated n′ for said input N; and output means for reading out said n′ for said input N from said n′ storage means, and for outputting said read-out value n′ as the output n′ from said modular inverse calculating means.
 27. The apparatus of claim 18, where said t is equal to a predetermined number w of bits, said input values X, N and input value k′ are expressed in units of w bits, k′ being an integer equal to or greater than 1, said division apparatus comprising: X, N and k′ storage means for storing said input values X, N and k′ respectively; modular inverse calculating means for calculating n′=−N⁻¹ mod 2^(w) for said N and the number w of bits which are processed by said division apparatus at a time; modular multiplication means for calculating s′=Xn′ mod 2^(w) using said n′, said X and said w; multiply/add means for calculating q=X+s′N for said N, said X and said s′, dividing means for calculating q/2^(−w) for said q and said w; and control means for executing the calculations by said modular inverse calculating means, said modular multiplication means, said multiply/add means and said dividing means K=[k′/w] times and further executing said calculations once again after setting k mod w as w, for updating said X in said X storage means with the calculation result by said dividing means for each round of K+1 executions, and for outputting the calculation result by said dividing means in the last round of K+1 executions of said calculations as the result of calculation of X2^(−w) mod N, the notation [a] being a maximum integer not exceeding a given real number a.
 28. The apparatus of claim 18, where said t is equal to a predetermined number w of bits, said input values X, N and input k′ are expressed in units of w bits, k′ being an integer equal to or greater than 1, said dividing means by power of 2 comprising: X, N and k′ storage means for storing said input values X, N and k′ respectively; n′ storage means for storing a precalculated value n′=−N⁻¹ mod 2^(w); modular multiplication means for calculating s′=Xn′ mod 2^(w) using said n′, said X and said w; multiply/add means for calculating q=X+s′N for said N, said X and said s′, dividing means for calculating q/2^(−w) for said q and said w; and control means for executing the calculations by said modular multiplication means, said multiply/add means and said dividing means K=[k′/w] times and further executing said calculations once again after setting k′ mod w as w, for updating said X in said X storage means with the calculation result by said divide means for each round of K+1 executions, and for outputting the calculation result by said divide means in the last round of K+1 executions of said calculations as the result Y of calculation of X2^(−t) mod N, the notation [a] being a maximum integer not exceeding a given real number a.
 29. The apparatus of claim 18, where said t is equal to predetermined number w of bits, said dividing means by power of comprising: X, N and k′ storage means for storing said input values X, N and k′, respectively, k′ being an integer equal to or greater than 1; splitting means for splitting said value k′ into p values w₁, w₂, . . . , w_(p) which satisfy k′=w₁+w₂+ . . . +w_(p), and for outputting them, w_(i) being greater than 0, where i=1, 2, . . . , p; and p division parts, an i-th one of said p division parts being supplied with values N, X_(i−1) and w_(i) as the inputs thereto, and comprising: modular inverse calculating means for calculating n′=−N ⁻¹ mod 2^(w); modular multiplication means for calculating s′=X _(i−1) n′ mod 2^(w) using said values n′, said X_(i−1) and said w_(i); multiply/add means for calculating q=X_(i−1)+s′N for said values N, X_(i−1) and s′; and dividing means by power of 2 for calculating q/2^(w) _(i) for said values q and w_(i) and for outputting the calculation result as X_(i); wherein a first one of said division parts is supplied with said value X as a value X₀ and a p-th one of said p division parts outputs said calculation result X_(p) as the result of calculation of X2^(−t) mod N.
 30. A computer readable recording medium having recorded thereon a modular inversion program for information security service which inputs n-bit values N and X and a parameter t given as pieces of security information and outputs a modular inverse X⁻¹2^(m) of X over a residue class ring or finite field GF(p) Z/NZ where said N is a part of cryptographic key information employed in the security service the input value X is calculated from an encrypted message, a digital signature, a random number or a message to be encrypted and the bit size of each of said X and N is n and said X is equal to or greater than 0 and less than said N, n being an integer equal to or greater than 1, said program comprises: (a) a step of storing said input parameter t in t storage means; (b) a step of storing said input value N in N storage means; (c) a step of calculating Y by the following equation using said stored values t and N and said input value X Y=X2^(−t) mod N; (d) a step of performing the following extended GCD algorism S=bgcd(Y, N)=Y ⁻¹2^(k) mod N; for said stored input value N and said calculation result Y to obtain S and k; (e) a step of performing the following calculation using said stored input value N and parameter t and said S and k R=S2^(−(k+t−m)) mod N, where: m=0, n, or 2n; and (f) a step of outputting said calculation result R as the modular inverse of said X to be used for calculation of an encrypted message, a decrypted message or a digital signature in the information security service.
 31. The recording medium of claim 30, wherein said program further comprising: (g) a step of storing said extended binary GCD calculation results S and k in S storage means and k storage means, respectively; and (h) a step of determining whether m−k−t is positive or negative using said stored k and said t and said m; and wherein said R calculating step (e) is a step of calculating R=S2^(−(k+t−m)) mod N if said determination result is negative, and calculating R=S2^(m−k−t) mod N if said determination result is positive.
 32. The recording medium of claim 30, wherein: said information security service utilizes an elliptic curve E/GF(p) over GF(p); said modular inversion in said program is a modular inversion in the calculation of λ in the following equations for calculating, from two points (x₁, y₁) and (x₂, y₂) on said elliptic curve E/GF(p), a point (x₃, y₃) of the sum of said two points λ=(y ₂ −y ₁)/(x ₂ −x ₁)mod p x ₃=λ² −x ₁ −x ₂ mod p y ₃=λ(x ₁ −x ₃)−y ₁ mod p; and, letting said λ being represented by the following equation with y=y₂−y₁ and X=x₂−x₁ λ=(y₂−y₁)(x₂−x₁)⁻¹ mod p=yX⁻¹ mod p: said N storing step (b) is a step of storing said p as said N, said Y calculating step (c) is a step of calculating Y by the following equation using said p as said N Y=X2^(−t) mod p; said binary GCD calculating (d) is a step of calculating S and k by the following equation using said p as said N S=bgcd(Y,p)=Y ⁻¹2^(k) mod p; and said modular inverse R calculating step (e) is a step of calculating X′ as said modular inverse R by the following equation X′=S2^(−(k+t−m)) mod p where m=0, n or 2n, and calculating λ by the following equation using said modular inverse X′ λ=yX′ mod p.
 33. The recording medium of claim 30, wherein: said information security service utilizes a digital signature scheme ESIGN; and, letting the following equation, which is part of a digital signature generating process, y=w/(kx ^(k−1))mod p where x, k, w are integers satisfy 0<x<pq, 0≦w<p, p and q being primes be represented by the following equation y=w/(kx ^(k−1))mod p=wX ⁻¹ mod p X=kx ^(k−1): said N storing step (b) is a step of storing said p as said N; said Y calculating step (c) is a step of setting X′=X ⁻¹ mod p and calculating Y by the following calculation using said p as said N Y=X2^(−t) mod p; said binary GCD calculating step (d) is a step of calculating S and k by the following equation using said p as said N S=bgcd(Y, p)=Y ⁻¹2^(k) mod p; and said modular inverse calculating step (e) is a step of calculating said X′ as said modular inverse R by the following equation X′=S2^(−(k+t−m)) mod p where m=0, n or 2n and performing the following equation using said modular inverse X′ y=wX ⁻¹ mod p=wX′ mod p.
 34. The recording medium of claim 30, wherein: said information security service utilizes a digital signature scheme RSA; and, setting R=r⁻¹ mod N in the following equation which is part of a blind signature generating process; s′=(r ^(e) m)^(d) mod N s=s′/r mod N where: r, m, e, d are integers satisfy 0<r, m<N and 0<e, d<ø (N): said Y calculating step (c) is a step of calculating Y by the following calculation using said r said input value X Y=r2^(−t) mod N; and said modular inverse calculating step (e) is a step of calculating said modular inverse R by the following equation R=S2^(−t) mod N and performing the following equation using said modular inverse R S=s′/r mod N=s′R mod N.
 35. The recording medium of claim 30, where said t is equal to a predetermined value w of bits and said step (c) comprising: (c-1) a step of storing said X and said N in X storage means and N storage means, respectively; (c-2) a modular inverse calculating step of calculating n′=−N⁻¹ mod 2^(w) for said N stored in said N storage means and said w, and storing said n′ in n′ storage means; (c-3) a step of calculating s′=Xn′ mod 2^(w) with said n′ stored in said n′ storage means, said X stored in said X storage means and said w, and storing said s′ in s′ storage means; (c-4) a step of calculating q=X+s′N for said N stored in said N storage means, said X stored in said S storage means and said s′ stored in said s′ storage means, and storing said q in q storage means; and (c-5) a step of calculating q/2^(w) for said q stored in said q storage means and said w, and outputting the calculation result Y.
 36. The recording medium of claim 30, where said t is equal to a predetermined value w of bits which are processed by a calculating apparatus at a time and a precalculated value n′=−N⁻¹ mod 2^(w) being prestored in n′ storage means, said step (c) comprising: (c-1) a step of storing said X and said N in X storage means and N storage means, respectively; (c-2) a step of calculating s′=Xn′ mod 2^(w) using said n′ stored in said n′ storage means, said X stored in said X storage means and said w, and storing said s′ in s′ storage means; (c-3) a step of calculating q=X+s′N for said N stored in said N storage means, said X stored in said X storage means and said s′ stored in said s′ storage means, and storing said q in q storage means; and (c-4) a step of calculating q/2^(w) for said q stored in said q storage means and said w, and outputting the calculation result Y.
 37. The recording medium of claim 30, where said t is equal to a predetermined number w of bits, said step (c) comprising: (c-1) a step of storing said X, said N and said k in X storage means, N storage means and k′ storage means, respectively, k′ being an integer equal to or greater than 1; (c-2) a modular inverse calculating step of calculating n′=−N⁻¹ mod 2^(w) for said N stored in said N storage means and the number w of bits which are processed by a calculating apparatus at a time, and storing said n′ in n′ storage means; (c-3) a step of calculating s′=Xn′ mod 2^(w) using said n′ stored in said n′ storage means, said X stored in said X storage means and said w, and storing said s′ in s′ storage means; (c-4) a step of calculating q=X+s′N for said N stored in said N storage means, said X stored in said X storage means and said s′ stored in said s′ storage means, and storing said q in q storage means; (c-5) a step of calculating q/2^(w) for said q stored in said q storage means and said w, and storing the calculation result in storage means; (c-6) a step of calculating w′=k′ mod w for said k′ stored in said k′ storage means and said w, and storing said w′ in w′ storage means; (c-7) a step of executing said steps (c-3), (c-4) and (c-5) K=[k′/w] times, the notation [a] representing a maximum integer not exceeding a given real number a, further executing said steps (c-3 ), (c-4) and (c-5) once again with said w set as said w′ stored in said w′ storage means, and updating said X stored in said storage means with the result of calculation in said step (c-5) for each round of K+1 executions of said steps; and (c-8) a step of outputting, as the calculation result Y, the calculation result in said step (c-5) in the last round of said K+1 executions.
 38. The recording medium of claim 30, where said t is equal to a predetermined value w of bits, a precalculated value n′=−N⁻¹ mod 2^(w) being prestored in n′ storage means, said step (c) comprising: (c-1) a step of storing said X, said N and said k′ in X storage means, N storage means and k′ storage means, respectively, k′ being an integer equal to or greater than 1; (c-2) a step of calculating s′=Xn′ mod 2^(w) using said n′ stored in said n′ storage means, said X stored in said X storage means and said w, and storing said s′ in s′ storage means; (c-3) a step of calculating q=X+s′N for said N stored in said N storage means, said X stored in said X storage means and said s′ stored in said s′ storage means, and storing said q in q storage means; (c-4) a step of calculating q/2^(w) for said q stored in said q storage means and said w, and storing the calculation result in storage means; (c-5) a step of calculating w′=k′ mod w for said k stored in said k′ storage means and said w, and storing said w′ in w′ storage means; (c-6) a step of executing said steps (c-2), (c-3) and (c-4) K=[k′/w] times, the notation [a] representing a maximum integer not exceeding a given real number a, further executing said steps (c-2), (c-3) and (c-4) once again with said w set as said w′ stored in said w′ storage means, and updating said X stored in said storage means with the result of calculation in said step (c-4) for each round of K+1 executions of said steps; and (c-7) a process of outputting, as the calculation result Y, the calculation result in said step (c-4) in the last round of said K+1 executions. 